相关论文: Two Combinatorial Geometric Problems Involving Mod…

In this paper, we continue the study of small squares containing at least two points on a modular hyperbola $x y \equiv c \pmod{p}$. We deduce a lower bound for its side length. We also investigate what happens if the ``distances" between…

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

A convex body $R$ in the hyperbolic plane is reduced if any convex body $K\subset R$ has a smaller minimal width than $R$. We answer a few of Lassak's questions about ordinary reduced polygons regarding its perimeter, diameter and…

We give a survey of a variety of recent results about the distribution and some geometric properties of points $(x,y)$ on modular hyperbolas $xy \equiv a \pmod m$. We also outline a very diverse range of applications of such results,…

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We provide two new bounds on the number of visible points on exponential curves modulo a prime for all choices of primes. We also provide one new bound on the number of visible points on exponential curves modulo a prime for almost all…

We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give…

We consider the space $\mathcal M$ of ordered quadruples of distinct points in the boundary of complex hyperbolic $n$-space, $\ch{n},$ up to its holomorphic isometry group ${\rm PU}(n,1).$ One of the important problems in complex hyperbolic…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

We adapt linear programming methods from sphere packings to closed hyperbolic surfaces and obtain new upper bounds on their systole, their kissing number, the first positive eigenvalue of their Laplacian, the multiplicity of their first…

We prove the global classical solvability of initial-boundary problems for semilinear first-order hyperbolic systems subjected to local and nonlocal nonlinear boundary conditions. We also establish lower bounds for the order of nonlinearity…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

We show, under some natural restrictions, that some semigroup orbits of polynomials cannot contain too many elements of small multiplicative order modulo a large prime $p$, extending previous work of Shparlinski (2017).

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

We consider equidistribution of angles for certain hyperbolic lattice points in the upper half-plane. Extending work of Friedlander and Iwaniec we show that for the full modular group equidistribution persists for matrices with…