Related papers: Multiplicatively dependent integer vectors on a hy…

We obtain formulas for the growth rate of the numbers of certain paths in infinite graphs built on the two-dimensional Eulerian graph. Corollaries are identities relating Stirling numbers of the first and second kinds.

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

H. N. V. Temperley's method for counting vertically convex polyominoes is modified, generalized, and most importantly, programmed (in Maple).

Given an extension of number fields $E \subset F$ and a projective variety $X$ over $F$, we compare the problem of counting the number of rational points of bounded height on $X$ with that of its Weil restriction over $E$. In particular, we…

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…

This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…

We prove multiplier theorems on rank one noncompact symmetric spaces which improve aspects of existing results. A common theme of our main results is that we partially drop specific assumptions on the multiplier function such as a…

In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…

M. Mustata used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give an alternate proof using a log resolution, which is simpler and allows us to consider non-reduced arrangements. By applying the idea of…

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…

We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of $\mathbb{P}^3$ outside certain planes using universal torsors.

We give a new proof of a result of DiPippo and Wan for counting points of bounded height on projective spaces over global function fields. The new proof adapts the geometry of numbers arguments used by Schanuel in the number field case.

In our work, we consider the problem of computing a vector $x \in Z^n$ of minimum $\|\cdot\|_p$-norm such that $a^\top x \not= a_0$, for any vector $(a,a_0)$ from a given subset of $Z^n$ of size $m$. In other words, we search for a vector…

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

We establish asymptotic formulae for the number of biquadratic number fields of bounded discriminant that can be embedded into a quaternionic or a dihedral extension. To prove these results, we express the solvability of these inverse…