The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one has $x+y\ne z$ equals $$
3\cdot 4^N+N3^{N+1} + O((3-c_*)^N) $$ for some absolute constant $c_*>0$. This provides a tight estimate for the number of independent sets in a special 3-uniform linear hypergraph and gives a support for the natural conjecture concerning the maximal possible number of independent sets in such hypergraphs on $n$ vertices.
We show that the problem of counting collinear points in a permutation (previously considered by the author and J. Solymosi in "Collinear Points in Permutations", 2005) and the well-known finite plane Kakeya problem are intimately connected. Via counting arguments and by studying the hypergraph of collinear triples we show a new lower bound (5q/14 + O(1)) for the number of collinear triples of a permutation of GF(q) and a new lower bound (q(q + 1)/2 + 5q/14 + O(1)) on the size of the smallest Besicovitch set in GF(q)^2. Several interesting questions about the structure of the collinear triple …
In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof contains an application of a recently resolved conjecture of Alon and Kahn on the number of independent sets in a regular graph.
In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting. As a consequence, we determine the typical structure and asymptotic number of sum-free sets of order $m$ in Abelian groups $G$ whose order is divisible by a prime $q$ with $q \equiv 2 \pmod 3$, for every $m \ge C(q) \sqrt{n \log n}$, thus extending and refining a theorem of Green and Ruzsa. In particular, we prove that almost all sum-free subsets of size $m…
Let $a(n)$ denote the number of non-isomorphic abelian groups with $n$ elements. In 1991 Ivić proved an asymptotic formula of the sum $\sum_{n\leq x} a(n+ a(n)).$ In this paper, we will prove a sharper asymptotic formula for this sum.
We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves case.
This paper contains two parts toward studying abelian varieties from the classification point of view. In a series of papers, the current authors and T.-C. Yang obtain explicit formulas for the numbers of superspecial abelian surfaces over finite fields. In this paper, we give an explicit formula for the size of the isogeny class of simple abelian surfaces with real Weil number $\sqrt{q}$. This establishes a key step that one may extend our previous explicit calculations of superspecial abelian surfaces to those of supersingular abelian surfaces.The second part is to introduce the notion of ge…
Many important theorems in combinatorics, such as Szemerédi's theorem on arithmetic progressions and the Erdős-Stone Theorem in extremal graph theory, can be phrased as statements about independent sets in uniform hypergraphs. In recent years, an important trend in the area has been to extend such classical results to the so-called sparse random setting. This line of research culminated recently in the breakthroughs of Conlon and Gowers and of Schacht, who developed general tools for solving problems of this type. In this paper, we provide a third, completely different approach to proving extr…
We study the enumerative geometry of algebraic curves on abelian surfaces and threefolds. In the abelian surface case, the theory is parallel to the well-developed study of the reduced Gromov-Witten theory of K3 surfaces. We prove complete results in all genera for primitive classes. The generating series are quasimodular forms of pure weight. Conjectures for imprimitive classes are presented. In genus 2, the counts in all classes are proven. Special counts match the Euler characteristic calculations of the moduli spaces of stable pairs on abelian surfaces by Göttsche-Shende. A formula for hyp…
We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these factorisations and find average orders.
We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the distribution of Elkies primes, we obtain improvements over Schoof's method in two cases. If the abelian surface A over Fq has RM by a fixed quadratic field F, we reach the same asymptotic complexity Otilde(log4 q) as the SEA algorithm up to constant factors depending on F. If A is defined over a number field, we count points on A modulo sufficiently many pri…
For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at least for small dimensions g=2 and g=3, can actually be made explicit, and we show that computing the number of solutions is reduced to the classical topic in Number Theory of counting points of the lattice Z^n lying on an explicit bounded subset of R^n. We obtain, for Abelian varieties of small dimension, some upper bounds for the counting function.
We give an exact formula for the number of $G$-extensions of local function fields $\mathbb{F}_q((t))$ for finite abelian groups $G$ up to a conductor bound. As an application we give a lower bound for the corresponding counting problem by discriminant.
Let $K$ be a number field and $G$ a finite abelian group. We study the asymptotic behaviour of the number of tamely ramified $G$-extensions of $K$ with ring of integers of fixed realisable class as a Galois module.
Let $G$ be a Frobenius group with an abelian Frobenius kernel $F$ and let $k$ be a finite extension of $\mathbb{Q}$. We obtain an upper bound for the number of degree $|F|$ algebraic extensions $K/k$ with Galois group $G$ with the norm of the discriminant $\mathcal{N}_{k/\mathbb{Q}}(d_{K/k})$ bounded above by $X$. We extend this method for any group $G$ that has an abelian normal subgroup. If $G$ has an abelian normal subgroup, then we obtain upper bounds for the number of degree $|G|$ extensions $N/k$ with Galois group $G$ with bounded norm of the discriminant. Malle made a conjecture about w…
We extend the dictionary between the BPS spectrum of Heterotic strings and the one of F-/M-theory compactifications on $K3$ fibered Calabi-Yau 3-folds to cases with higher rank non-Abelian gauge groups and in particular to dual pairs between Heterotic CHL orbifolds and compactifications on Calabi-Yau 3-folds with a compatible genus one fibration. We show how to obtain the new supersymmetric index purely from the Calabi-Yau geometry by reconstructing the Noether-Lefschetz generators, which are vector-valued modular forms. There is an isomorphism between the latter objects and vector-valued latt…
We obtain strong information on the asymptotic behaviour of the counting function for nilpotent Galois extensions with bounded discriminant of arbitrary number fields. This extends previous investigations for the case of abelian groups. In particular, the result confirms a conjecture by the second author on this function for arbitrary groups in the nilpotent case. We further prove compatibility of the conjecture with taking wreath products with the cyclic group of order 2 and give examples in degree up to 8.
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative properties of related counting functions for finite Abelian groups are immediate consequences of these formulae.
We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit Theorems, provided that $d \geq 9$. We also study more refined versions pertaining to "spiraling of approximations". Our techniques are dynamical in nature and exploit effective exponential mixing of all orders for actions of higher-rank abelian groups on the space of unimodular lattices.
