Related papers: On particular diameter bounds for integral point s…
We give a method for taking microscopic limits of normal matrix ensembles. We apply this method to study the behaviour near certain types of singular points on the boundary of the droplet. Our investigation includes ensembles without…
The invariant classification of superintegrable systems is reviewed and utilized to construct singular limits between the systems. It is shown, by construction, that all superintegrable systems on conformally flat, 3D complex Riemannian…
We prove bounds on approximate incidences between families of circles and families of points in the plane. As a consequence, we prove a lower bound for the dimension of circular $(u,v)$-Furstenberg sets, which is new for large $u$ and $v$.
We establish a higher-dimensional irrationality criterion for periods which are presented as Mellin integrals depending on many parameters. The criterion is stated as an upper bound on the multi-variate transfinite diameter of the image of…
We prove uniform upper bounds on the number of integral points of bounded height on affine varieties. If $X$ is an irreducible affine variety of degree $d\geq 4$ in $\mathbb{A}^n$ which is not the preimage of a curve under a linear map…
We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…
We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane. Along the way, inside the hexagonal honeycomb, we provide minimizers for each n .
We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…
We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…
We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…
Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…
Linkage methods are among the most popular algorithms for hierarchical clustering. Despite their relevance the current knowledge regarding the quality of the clustering produced by these methods is limited. Here, we improve the currently…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
We consider superintegrability in classical mechanics in the presence of magnetic fields. We focus on three-dimensional systems which are separable in Cartesian coordinates. We construct all possible minimally and maximally superintegrable…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…