Related papers: Gapsets and the $k$-generalized Fibonacci sequence…
We define and study the essential dimension of an algebraic stack. We compute the essential dimension of the stacks Mgn and MgnBar of smooth, or stable, n-pointed curves of genus g. We also prove a general lower bound for the essential…
We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…
In this paper, we initiate a systematic study of the generalized Hilbert-Kunz multiplicity for families of ideals in a Noetherian local ring (R,m) of positive characteristic, and introduce a new asymptotic invariant called the Amao-type…
Guth and Katz proved that, as conjectured by Elekes and Sharir, $m$ lines in 3-space have at most constant times $ m^{3/2}$ intersection points, aside from some obvious counter examples. We give an explicit bound for the constant, using the…
We investigate the possible values for geometric genera of subvarieties in a smooth projective variety. Values which are not attained are called gaps. For curves on a very general surface in $\mathbb{P}^3$, the initial gap interval was…
In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we extend some of the notions that appear naturally in connection with these algorithms to the…
Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…
The Bounded Height Conjecture of Bombieri, Masser, and Zannier states that for any sufficiently generic algebraic subvariety of a semiabelian $\overline{\mathbb{Q}}$-variety $G$ there is an upper bound on the Weil height of the points…
We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…
We provide a method for counting number fields of fixed Galois group ordered by arbitrary inertial invariants using analytic techniques from the study of multiple Dirichlet series. We prove unconditional results for infinitely many new…
The main contribution of this paper is the proof of the generic finiteness of Dziobek central configurations for a homogeneous potential and the derivation of a uniform upper bound for their number. By exploiting the isomorphism between the…
A recent work of Abbasi et al. [FOCS 2023] introduced the notion of $\varepsilon$-scatter dimension of a metric space and showed a general framework for efficient parameterized approximation schemes (so-called EPASes) for a wide range of…
Let $K/F$ be a finite Galois extension of fields with $Gal(K/F)=\Gamma$. In an earlier work of Timothy Kohl, the author enumerated dihedral Hopf-Galois structures acting on dihedral extensions. Dihedral group is one particular example of…
We define two new families of invariants for (3-manifold, graph) pairs which detect the unknot and are additive under connected sum of pairs and (-1/2)-additive under trivalent vertex sum of pairs. The first of these families is closely…
We introduce a notion of depth three tower of three rings C < B < A with depth two ring extension A | B recovered when B = C. If A = \End B_C and B | C is a Frobenius extension, this captures the notion of depth three for a Frobenius…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.
Consider fixed and bounded trace Gaussian orthogonal, unitary and symplectic ensembles, closely related to Gaussian ensembles without any constraint. For three restricted trace Gaussian ensembles, we prove universal limits of correlation…
We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches…
We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph in terms of its number of vertices, girth, and maximal degree. Equality holds only for Moore graphs, which gives a new characterization of…