Downloads & Free Reading Options - Results

We reprove the Lefschetz trace formula for stacks (in the context of derived categories and the six operations for stacks developed by Laszlo and Olsson), and give the meromorphic continuation of L-series (in particular, zeta functions) of Artin stacks over a finite field. We also give an upper bound for the weights of the cohomology groups of stacks, and an "independence of l" result for a certain class of quotient stacks.

We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for discrete-log based cryptosystems. Our algorithm provides an alternative to the traditional CM method for constructing genus 2 curves. For a quartic CM field K with primitive CM type, we compute the Igusa class polynomials modulo p for certain small primes p and then use the Chinese remainder theorem (CRT) and a bound on the denominators to construct the class polynomials. We also provide an algorithm for determining endomorphism rings of ordinary Jacobians of genus 2 curves over finite fields, generalizing the work of Kohel for elliptic curves.

Let $\Phi $ be a Drinfeld $\mathbf{F}_{q}[T]$-module of rank 2, over a finite field $L$, a finite extension of $n$ degrees of a finite field with $q$ elements $\mathbf{F}_{q}$. Let $m$ be the extension degrees of $ L$ over the field $\mathbf{F}_{q}[T]/P$, $P$ is the $\mathbf{F}%_{q}[T]$-characteristic of $L$, and $d$ the degree of the polynomial $P$. We will discuss about a many analogies points with elliptic curves. We start by the endomorphism ring of a Drinfeld $\mathbf{F}_{q}[T]$-module of rank 2, End$_{L}\Phi $, and we specify the maximality conditions and non maximality conditions as a $\mathbf{F}_{q}[T]$-order in the ring of division End$_{L}\Phi \otimes _{\mathbf{F}_{q}[T]}% \mathbf{F}_{q}(T)$, in the next point we will interested to the characteristic polynomial of a Drinfeld module of rank 2 and used it to calculate the number of isogeny classes for such module, at last we will interested to the Characteristic of Euler-Poincare $\chi_{\Phi}$ and we will calculated the cardinal of this ideals.

We prove that every mapping torus of any free group endomorphism is residually finite. We show how to use a not yet published result of E. Hrushovski to extend our result to arbitrary linear groups. The proof uses algebraic self-maps of affine spaces over finite fields. In particular, we prove that when such a map is dominant, the set of its fixed closed scheme points is Zariski dense in the affine space.

We study the distribution of the traces of the Frobenius endomorphism of genus $g$ curves which are quartic non-cyclic covers of $\mathbb{P}^{1}_{\mathbb{F}_{q}}$, as the curve varies in an irreducible component of the moduli space. We show that for $q$ fixed, the limiting distribution of the trace of Frobenius equals the sum of $q + 1$ independent random discrete variables. We also show that when both $g$ and $q$ go to infinity, the normalized trace has a standard complex Gaussian distribution. Finally, we extend these computations to the general case of arbitrary covers of $\mathbb{P}^{1}_{\mathbb{F}_{q}}$ with Galois group isomorphic to $r$ copies of $\mathbb{Z}/2\mathbb{Z}$. For $r = 1$, we recover the already known hyperelliptic case. We also include an appendix by Alina Bucur giving the heuristic of these distributions.

We propose a systematic method to produce potentially good recursive towers over finite fields. The graph point of view, so as some magma and sage computations are used in this process. We also establish some theoretical functional criterion ensuring the existence of many rational points on a recursive tower. Both points are illustrated on an example, from the production process, to the theoretical study, using this functional criterion, of the parameters of the obtained potentially good tower.

The aim of this note is to record a proof that the estimate $$\max{\{|A+A|,|A:A|\}}\gg{|A|^{12/11}}$$ holds for any set $A\subset{\mathbb{F}_q}$, provided that $A$ satisfies certain conditions which state that it is not too close to being a subfield. An analogous result was established in \cite{LiORN}, with the product set $A\cdot{A}$ in the place of the ratio set $A:A$. The sum-ratio estimate here beats the sum-product estimate in \cite{LiORN} by a logarithmic factor, with slightly improved conditions for the set $A$, and the proof is arguably a little more intuitive. The sum-ratio estimate was mentioned in \cite{LiORN}, but a proof was not given.

We prove the finite-time collapse of a system of N classical fields, which are described by N coupled nonlinear Schrodinger equations. We derive the conditions under which all of the fields experiences this finite-time collapse. Finally, for two-dimensional systems, we derive constraints on the number of particles associated with each field that are necessary to prevent collapse.

For a prime p, a Diophantine m-tuple in $\mathbb{F}_p$ is a set of m nonzero elements of $\mathbb{F}_p$ with the property that the product of any two of its distinct elements is one less than a square. In this paper, we present formulas for the number $N^{(m)}(p)$ of Diophantine m-tuples in $\mathbb{F}_p$ for m=2,3 and 4. Fourier coefficients of certain modular forms appear in the formula for the number of Diophantine quadruples. We prove that asymptotically $N^{(m)}(p)=\frac{1}{2^{m \choose 2 }}\frac{p^m}{m!} + o(p^m)$, and also show that if $p>2^{2m-2}m^2$, then there is at least one Diophantine m-tuple in $\mathbb{F}_p$.

In electromagnetic simulations of magnets and machines one is often interested in a highly accurate and local evaluation of the magnetic field uniformity. Based on local post-processing of the solution, a defect correction scheme is proposed as an easy to realize alternative to higher order finite element or hybrid approaches. Radial basis functions (RBF)s are key for the generality of the method, which in particular can handle unstructured grids. Also, contrary to conventional finite element basis functions, higher derivatives of the solution can be evaluated, as required, e.g., for deflection magnets. Defect correction is applied to obtain a solution with improved accuracy and adjoint techniques are used to estimate the remaining error for a specific quantity of interest. Significantly improved (local) convergence orders are obtained. The scheme is also applied to the simulation of a Stern-Gerlach magnet currently in operation.

Let $\mathbb{K}$ be the algebraic closure of a finite field $\mathbb{F}_q$ of odd characteristic $p$. For a positive integer $m$ prime to $p$, let $F=\mathbb{K}(x,y)$ be the transcendency degree $1$ function field defined by $y^q+y=x^m+x^{-m}$. Let $t=x^{m(q-1)}$ and $H=\mathbb{K}(t)$. The extension $F|H$ is a non-Galois extension. Let $K$ be the Galois closure of $F$ with respect to $H$. By a result of Stichtenoth, $K$ has genus $g(K)=(qm-1)(q-1)$, $p$-rank (Hasse-Witt invariant) $\gamma(K)=(q-1)^2$ and a $\mathbb{K}$-automorphism group of order at least $2q^2m(q-1)$. In this paper we prove that this subgroup is the full $\mathbb{K}$-automorphism group of $K$; more precisely $Aut_{\mathbb {K}}(K)=Q\rtimes D$ where $Q$ is an elementary abelian $p$-group of order $q^2$ and $D$ has a index $2$ cyclic subgroup of order $m(q-1)$. In particular, $\sqrt{m}|Aut_{\mathbb{K}}(K)|> g(K)^{3/2}$, and if $K$ is ordinary (i.e. $g(K)=\gamma(K)$) then $|Aut_{\mathbb{K}}(K)|>g^{3/2}$. On the other hand, if $G$ is a solvable subgroup of the $\mathbb{K}$-automorphism group of an ordinary, transcendency degree $1$ function field $L$ of genus $g(L)\geq 2$ defined over $\mathbb{K}$, then by a result due to Korchm\'aros and Montanucci, $|Aut_{\mathbb{K}}(K)|\le 34 (g(L)+1)^{3/2}

We develop the general formalism for the study of neutrino propagation in presence of stochastic media. This formalism allows the systematic derivation of evolution equations for averaged quantities as survival probabilities and higher order distribution moments. The formalism applies equally to any finite dimensional Schroedinger equation in presence of a stochastic external force. New integro-differential equations valid for finite correlated processes are obtained for the first time. For the particular case of exponentially correlated processes a second order ordinary equation is obtained. As a consequence, the Redfield equation valid for Gaussian delta-correlated noise is rederived in a simple way. The formalism, together with the quantum correlation theorem is applied to the computation of higher moments and correlation functions of practical interest in forthcoming high precision neutrino experiments. It is shown that equal and not equal time correlators follow similar differential equations.

The quantization rules recently proposed by M. Navarro (and independently I.V. Kanatchikov) for a finite-dimensional formulation of quantum field theory are applied to the Klein-Gordon and the Dirac fields to obtain the quantum equations of motion of both fields. In doing so several problems arise. Solving these difficulties leads us to propose a new classical canonical formalism, which, in turn, leads us to new, improved rules of quantization. We show that the new classical equations of motion and rules of quantization overcome several known unsatisfactory features of the previous formalism. We argue that the new formalism is a general improvement with respect to the previous one. Further we show that the quantum field theory of the Dirac and Klein-Gordon field describes particles with extra, harmonic-oscillator-like degrees of freedom. We argue that these degrees of freedom should give rise to a multi-particle interpretation of the formalism.

Motivated by the problem of determining the structure of integral points on subvarieties of semiabelian varieties defined over finite fields, we prove a quantifier elimination result for certain modules over finite simple extensions of the integers given together with predicates for orbits of the distinguished generator of the ring.

An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over an arbitrary finite field. For systems that can be described by monomials, one can obtain information about the limit cycle structure from the structure of the monomials. In particular, the paper contains a sufficient condition for a monomial system to have only fixed points as limit cycles. The condition is derived by reducing the problem to the study of a Boolean monomial system and a linear system over a finite ring.

The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic relations between these two points of view. Counting points is also related to the $\ell$-adic cohomology of the arrangement (as a variety). We describe the eigenvalues of the Frobenius map acting on this cohomology, which corresponds to a finer decomposition of the zeta function. The $\ell$-adic cohomology groups and their decomposition into eigenspaces are shown to be fully determined by combinatorial data. Finally, it is shown that the zeta function is determined by the topology of the corresponding complex variety in some important cases.

The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic relations between these two points of view. Counting points is also related to the $\ell$-adic cohomology of the arrangement (as a variety). We describe the eigenvalues of the Frobenius map acting on this cohomology, which corresponds to a finer decomposition of the zeta function. The $\ell$-adic cohomology groups and their decomposition into eigenspaces are shown to be fully determined by combinatorial data. Finally, it is shown that the zeta function is determined by the topology of the corresponding complex variety in some important cases.

We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations can be done efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite morphisms, and hence Picard and Albanese maps on Jacobians; generating uniformly random divisors and points on Jacobians; computing Frobenius maps and Kummer maps; and finding a basis for the $l$-torsion of the Picard group, where $l$ is a prime number different from the characteristic of the base field.

We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and more recent results avoiding the use of exponential sums, the usual tool to deal with these problems.

In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such results to polynomials of degrees higher than the characteristic of the field. Such results have a wide scope of applications similar to those associated with their counterparts studying consecutive intervals over prime fields instead of affine subspaces. Here we give only two immediate consequences: to a bound on the size of the intersection of orbits of polynomial dynamical systems with affine subspaces and to the Waring problem in affine subspaces. These results are based on estimates for a certain new type of exponential sums.

We formulate an analogue of the conjecture of Birch and Swinnerton-Dyer for Abelian schemes with everywhere good reduction over higher dimensional bases over finite fields. We prove some conditional results on it, and prove the conjecture for constant or isotrivial Abelian schemes.

We study differential equations $F(y,...,y^{(n)})=0$ where $F(Y_0,...,Y_n)$ is a formal series in $Y_0,...,Y_n$ with coefficients in some field of \emph{generalized power series} $\mathds{K}_r$ with finite rank $r\in\mathbb{N}^*$. Our purpose is to understand the connection between the set of exponents of the coefficients of the equation $\textrm{Supp} F$ and the set $\textrm{Supp} y_0$ of exponents of the elements $y_0\in\mathds{K}_r$ that are solutions.

We study differential equations $F(y,...,y^{(n)})=0$ where $F(Y_0,...,Y_n)$ is a formal series in $Y_0,...,Y_n$ with coefficients in some field of \emph{generalized power series} $\mathds{K}_r$ with finite rank $r\in\mathbb{N}^*$. Our purpose is to understand the connection between the set of exponents of the coefficients of the equation $\textrm{Supp} F$ and the set $\textrm{Supp} y_0$ of exponents of the elements $y_0\in\mathds{K}_r$ that are solutions.

Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dimensions of subsystem and co-subystem are introduced that maintain or improve the minimum distance. As a consequence, many optimal subsystem codes are obtained. Furthermore, it is shown how given subsystem codes can be extended, shortened, or combined to yield new subsystem codes. These subsystem code constructions are used to derive tables of upper and lower bounds on the subsystem code parameters.

We prove that if $A \subset {\Bbb F}_q$ is such that $$|A|>q^{{1/2}+\frac{1}{2d}},$$ then $${\Bbb F}_q^{*} \subset dA^2=A^2+...+A^2 d \text{times},$$ where $$A^2=\{a \cdot a': a,a' \in A\},$$ and where ${\Bbb F}_q^{*}$ denotes the multiplicative group of the finite field ${\Bbb F}_q$. In particular, we cover ${\Bbb F}_q^{*}$ by $A^2+A^2$ if $|A|>q^{{3/4}}$. Furthermore, we prove that if $$|A| \ge C_{size}^{\frac{1}{d}}q^{{1/2}+\frac{1}{2(2d-1)}},$$ then $$|dA^2| \ge q \cdot \frac{C^2_{size}}{C^2_{size}+1}.$$ Thus $dA^2$ contains a positive proportion of the elements of ${\Bbb F}_q$ under a considerably weaker size assumption.We use the geometry of ${\Bbb F}_q^d$, averages over hyper-planes and orthogonality properties of character sums. In particular, we see that using operators that are smoothing on $L^2$ in the Euclidean setting leads to non-trivial arithmetic consequences in the context of finite fields.

Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound $|B|\leq \sqrt{p}$ we prove $|B|\leq \sqrt{p}-1$, under suitable conditions on $p$. The new bound is valid for approximately three quarters of the primes $p=4k+1$.

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly over the field. The main ingredient is a result showing that constraining additional elements to be zero cannot result in a higher probability of full rank. The bound then follows by "zeroing" elements to produce a block-diagonal matrix, whose full rank probability can be computed exactly. The bound is shown to be at least as tight and can be strictly tighter than existing bounds.

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\F_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that is provably a generator or declares that it has failed in finding one. The algorithm relies on a relation generation technique in Joux's heuristically $L(1/4)$-method for discrete logarithm computation. Based on a heuristic assumption, the algorithm does succeed in finding a generator. For the special case when the order of $p$ in $(\Z/n\Z)^\times$ is small (that is $(\log_p(n))^{\mathcal{O}(1)}$), we present a modification with greater guarantee of success while making weaker heuristic assumptions.

In this paper we describe the dynamics of certain rational maps of the form $k \cdot (x+x^{-1})$ over finite fields of odd characteristic.

The spontaneous generation of homogeneous chromomagnetic fields in the lattice SU(3) gluodynamics is investigated in the deconfinement phase of the model. A new approach based on direct measurements of the field strength on a lattice is developed. Vacuum magnetization is established by its influence on the probability density function of the simulated field strength. It is found that both the chromomagnetic fields corresponding to the diagonal SU(3) generators are simultaneously condensated and appear to be spatially co-directed. No vacuum magnetization is detected for the other SU(3) components. The temperature dependence of the spontaneously generated fields in physical units is fitted in the temperature interval 200 MeV - 200 GeV as the usual power law with the anomalous dimension.

In this paper, we replace the asymptotic enrichments around the crack tip in the extended finite element method (XFEM) with the semi-analytical solution obtained by the scaled boundary finite element method (SBFEM). The proposed method does not require special numerical integration technique to compute the stiffness matrix and it improves the capability of the XFEM to model cracks in homogeneous and/or heterogeneous materials without a priori knowledge of the asymptotic solutions. A heaviside enrichment is used to represent the jump across the discontinuity surface. We call the method as the extended scaled boundary finite element method (xSBFEM). Numerical results presented for a few benchmark problems in the context of linear elastic fracture mechanics show that the proposed method yields accurate results with improved condition number. A simple MATLAB code is annexed to compute the terms in the stiffness matrix, which can easily be integrated in any existing FEM/XFEM code.

In this paper, we replace the asymptotic enrichments around the crack tip in the extended finite element method (XFEM) with the semi-analytical solution obtained by the scaled boundary finite element method (SBFEM). The proposed method does not require special numerical integration technique to compute the stiffness matrix and it improves the capability of the XFEM to model cracks in homogeneous and/or heterogeneous materials without a priori knowledge of the asymptotic solutions. A heaviside enrichment is used to represent the jump across the discontinuity surface. We call the method as the extended scaled boundary finite element method (xSBFEM). Numerical results presented for a few benchmark problems in the context of linear elastic fracture mechanics show that the proposed method yields accurate results with improved condition number. A simple MATLAB code is annexed to compute the terms in the stiffness matrix, which can easily be integrated in any existing FEM/XFEM code.

The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight case, and a series of fundamental qualitative properties of the asymptotic growth rate of the average weight distribution are proved. Based on this analysis, a general result, including all previous results as special cases, is established for the minimum distance of individual codes in a regular LDPC code ensemble.

We study analogues of Tate's conjecture on homomorphisms for abelian varieties when the ground field is finitely generated over an algebraic closure of a finite field. Our results cover the case of abelian varieties without nontrivial endomorphisms.

We count the number of isogeny classes of Edwards curves over finite fields, answering a question recently posed by Rezaeian and Shparlinski. We also show that each isogeny class contains a {\em complete} Edwards curve, and that an Edwards curve is isogenous to an {\em original} Edwards curve over $\F_q$ if and only if its group order is divisible by 8 if $q \equiv -1 \pmod{4}$, and 16 if $q \equiv 1 \pmod{4}$. Furthermore, we give formulae for the proportion of $d \in \F_q \setminus \{0,1\}$ for which the Edwards curve $E_d$ is complete or original, relative to the total number of $d$ in each isogeny class.

For prime powers q

The problem of P vs. NP is very serious, and solutions to the problem can help save lives. This article is an attempt at solving the problem using a computer algorithm. It is presented in a fashion that will hopefully allow for easy understanding for many people and scientists from many diverse fields. In technical terms, a novel method for solving k-SAT is explained. This method is primarily based on linear algebra and finite fields. Evidence is given that this method may require rougly O(n^3) time and space for deterministic models. More specifically the algorithm runs in time O(P V(n+V)^2) with mistaking satisfiable Boolean expressions as unsatisfiable with an approximate probablity 1 / \Theta(V(n+V)^2)^P, where n is the number of clauses and V is the number of variables. It's concluded that significant evidence exists that P=NP. There is a forum devoted to this paper at http://482527.ForumRomanum.com. All are invited to correspond here and help with the analysis of the algorithm. Source code for the associated algorithm can be found at https://sourceforge.net/p/la3sat.

Let G_0 be a connected unipotent algebraic group over a finite field F_q, and let G be the unipotent group over an algebraic closure F of F_q obtained from G_0 by extension of scalars. If M is a Frobenius-invariant character sheaf on G, we show that M comes from an irreducible perverse sheaf M_0 on G_0, which is pure of weight 0. As M ranges over all Frobenius-invariant character sheaves on G, the functions defined by the corresponding perverse sheaves M_0 form a basis of the space of conjugation-invariant functions on the finite group G_0(F_q), which is orthonormal with respect to the standard unnormalized Hermitian inner product. The matrix relating this basis to the basis formed by irreducible characters of G_0(F_q) is block-diagonal, with blocks corresponding to the L-packets (of characters, or, equivalently, of character sheaves). We also formulate and prove a suitable generalization of this result to the case where G_0 is a possibly disconnected unipotent group over F_q. (In general, Frobenius-invariant character sheaves on G are related to the irreducible characters of the groups of F_q-points of all pure inner forms of G_0.)

Let G_0 be a connected unipotent algebraic group over a finite field F_q, and let G be the unipotent group over an algebraic closure F of F_q obtained from G_0 by extension of scalars. If M is a Frobenius-invariant character sheaf on G, we show that M comes from an irreducible perverse sheaf M_0 on G_0, which is pure of weight 0. As M ranges over all Frobenius-invariant character sheaves on G, the functions defined by the corresponding perverse sheaves M_0 form a basis of the space of conjugation-invariant functions on the finite group G_0(F_q), which is orthonormal with respect to the standard unnormalized Hermitian inner product. The matrix relating this basis to the basis formed by irreducible characters of G_0(F_q) is block-diagonal, with blocks corresponding to the L-packets (of characters, or, equivalently, of character sheaves). We also formulate and prove a suitable generalization of this result to the case where G_0 is a possibly disconnected unipotent group over F_q. (In general, Frobenius-invariant character sheaves on G are related to the irreducible characters of the groups of F_q-points of all pure inner forms of G_0.)

We investigate the problem of how to obtain the force field between atoms of an experimentally determined structure. We show how this problem can be efficiently solved, even at finite temperature, where the position of the atoms differs substantially from the ground state. We apply our method to systems modeling proteins and demonstrate that the correct potentials can be recovered even in the presence of thermal noise.

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation polynomials that are involutions. Our results provide a fast algorithm (only modular operations are involved) to generate many classes of generalized cyclotomic permutation polynomials, their inverses, and involutions.

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique representation in the form $\sum_{j=1}^r c_ja_j$ with $c_j\in\mathbb{F}_p$. Let $D$ be a subset of $\mathbb{F}_p$. We consider the set $W_D$ of elements of $\mathbb{F}_q$ such that $c_j\in D$ for all $j=1,\ldots,r$. We give an estimate for the number of squares in the set $W_D$ which implies a weaker sufficient condition for the existence of squares in the set $W_D$ than in the recent paper of C.Dartyge, C.Mauduit, A.S\'ark\"ozy.

Let $\mathbb{F}_q$ stand for the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ denote the set of all the nonzero elements of $\mathbb{F}_{q}$. Let $m$ and $t$ be positive integers. In this paper, by using the Smith normal form of the exponent matrix, we obtain a formula for the number of rational points on the variety defined by the following system of equations over $\mathbb{F}_{q}$: $$ \sum\limits_{j=0}^{t-1}\sum\limits_{i=1}^{r_{j+1}-r_j} a_{k,r_j+i}x_1^{e^{(k)}_{r_j+i,1}}...x_{n_{j+1}}^{e^{(k)}_{r_j+i,n_{j+1}}}=b_k, \ k=1,...,m. $$ where the integers $t>0$, $r_0=0

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-014-4964-2). Furthermore, we give two classes of trinomial permutation polynomials, and make some progress on a conjecture about the differential uniformity of power permutation polynomials proposed by Blondeau et al. (Int. J. Inf. Coding Theory, 2010, 1, pp. 149-170).

For a finite field k and a triple of integers g \ge r \ge s \ge 0, we count the number of semilinear endomorphisms of a g-dimensional k-vector space which have rank r and stable rank s. Such endomorphisms show up naturally in the classification of finite flat group schemes of p-power order over k which are killed by p and have p-rank s, via Dieudonne theory.

We propose an efficient approach within the density-functional theory to determine the phonon structure of infinite solids under finite electric fields. We apply this approach to technological SrTiO$_3$, predicting many unusual properties--including a giant frequency shift, anomalous piezoelectric response, as well as striking dielectric tunability. A microscopic understanding for individual phonon modes under finite electric fields is also provided.

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen consecutively from a sequence in a finite field of odd prime characteristic. We study the arithmetic of such sequences, including bounds for the largest degree of irreducible factors, the number of irreducible factors, as well as for the number of such sequences of fixed length in which all the polynomials are irreducible.

We have investigated the far-infrared dipole modes of a quantum antidot submitted to a perpendicularly applied magnetic field B. The ground state of the antidot is described within local spin-density functional theory, and the spectrum within time-dependent local spin-density functional theory. The results are compared with those corresponding to a quantum dot of similar electronic surface density. The method is able to reproduce two of the more salient experimental features, namely that main bulk and edge modes have the same circular polarization, and that the negative B dispersion edge branch oscillates, having minima at the B values corresponding to fully occupied Landau levels. It fails, however, to yield the unique feature of short-period antidot lattices that the energy of the edge magnetoplasmon approaches the cyclotron frequency for small B. The existence of anticyclotron polarized bulk modes is discussed, and a detailed account of the dipole spin mode is presented.

We prove an implicit function theorem for C^k-maps from arbitrary topological vector spaces over valued fields to Banach spaces (for k at least 2). As a tool, we show the C^k-dependence of fixed points on parameters for suitable families of contractions of a Banach space. Similar results are obtained for k times strictly differentiable maps, and for k times Lipschitz differentiable maps. In the real case, our results subsume an implicit function theorem for Keller C^k_c-maps from arbitrary topological vector spaces to Banach spaces.