Related papers: Counting lattice triangulations: Fredholm equation…
Rudin conjectured that there are never more than c N^(1/2) squares in an arithmetic progression of length N. Motivated by this surprisingly difficult problem we formulate more than twenty conjectures in harmonic analysis, analytic number…
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a {\em…
In previous papers, for an arithmetical function $f_0$, we defined functions $f_m$ and $c_m$ and designated numbers of restricted words over a finite alphabet counted by these functions. In this paper, we examine the reverse problem for…
This paper is a continuation of the paper (A.G.Ramm, Amer. Math. Monthly, 108, N 9, (2001), 855-860), where bounded Fredholm operators are studied. The theory of bounded linear Fredholm-type operators is presented in many texts. This paper…
Consider triangulations of $\mathbb R P^2$ whose all vertices have valency six except three vertices of valency $4$. In this chapter we prove that the number $f(n)$ of such triangulations with no more than $n$ triangles grows as $C\cdot…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…
We study complexity in terms of degree growth of one-component lattice equations defined on a $3\times 3$ stencil. The equations include two in Hirota bilinear form and the Boussinesq equations of regular, modified and Schwarzian type.…
We consider the problem of approximate counting of triangles and longer fixed length cycles in directed graphs. For triangles, T\v{e}tek [ICALP'22] gave an algorithm that returns a $(1 \pm \eps)$-approximation in…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the…
We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…
Given $d\geq 2$, we show that the number of approximates $\frac{1}{q}\mathbf{p}\in \mathbb{Q}^d$ of $\mathbf{x}\in\mathbb{R}^d$ satisfying $|q\mathbf{x}-\mathbf{p}|\leq cq^{-\frac{1}{d}}$ with denominator $1\leq q < T$ decays to the…
The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
We study multiplicative inequalities among entries of Lorentzian matrices, referred to as bounded ratios. These inequalities can be viewed as generalizations of the classical Alexandrov--Fenchel inequalities for mixed volumes. Our main…
In this paper we develop further and refine the method of differential equations for computing Feynman integrals. In particular, we show that an additional iterative structure emerges for finite loop integrals. As a concrete non-trivial…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
Bounds for the poloidal and toroidal kinetic energies and the heat transport are computed numerically for rotating convection at infinite Prandtl number with both no slip and stress free boundaries. The constraints invoked in this…