Related papers: Notes on Laver Tables
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
We determine all 2- and 3-cocycles for Laver tables, an infinite sequence of finite structures obeying the left-selfdistributivity law; in particular, we describe simple explicit bases. This provides a number of new positive braid…
We give some results on a priori estimates and on estimates of type sup+inf and sup*inf.
In this note we would like to give an explicit lower bound by using a lower saturated subset of \mathbb{R}_{\geq 0}^n.
We shall generalize the notion of a Laver table to algebras which may have many generators, several fundamental operations, fundamental operations of arity higher than 2, and to algebras where only some of the operations are…
We establish a quantitative lower bound on the reach of flat norm minimizers for boundaries in $\mathbb{R}^2$.
We prove Berezin--Li--Yau-type lower bounds with additional term for the eigenvalues of the Stokes operator and improve the previously known estimates for the Laplace operator. Generalizations to higher-order operators are given.
The Lie algebras over the algebra of dual numbers are introduced and investigated.
We present new bounds for the Berezin number inequalities which improve on the existing bounds. We also obtain bounds for the Berezin norm of operators as well as the sum of two operators.
We conjecture a new lower bound on the algebraic connectivity of a graph that involves the number of vertices of high eccentricity in a graph. We prove that this lower bound implies a strengthening of the Laplacian Spread Conjecture. We…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
Sources of uncertainties in perturbative calculations, tadpole improvement and its role in lattice perturbation theory, and six recent calculations are discussed.
Another approach to constructing an upper bound for the Riemann-Farey sum is described.
A conjecture regarding the structure of expander graphs is discussed.
Recent lattice calculations of hadron structure functions are described.
We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…
We present several algorithms to generate tables for asymmetric numeral systems and prove that they are optimal in terms of discrepancy. In turn, this gives rise to the strongest proven bound on entropy loss. We further give improved…
In the paper we present some new inversion formulas and two new formulas for Stirling numbers.
In this article a new upper bounds for the multiple trigonometrical integrals are found. The method of the work based on a new method of estimation for the areas of algebraic surfaces.
This is a survey article on some recent developments in the arithmetic theory of linear algebraic groups over higher-dimensional fields, written for the Notices of the AMS.