Related papers: Combinatorial Bounds in Distal Structures

We construct a model complete and o-minimal expansion of the field of real numbers such that, for any planar analytic vector field X and any isolated, non-resonant hyperbolic singularity p of X, a transition map for X at p is definable in…

Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…

We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds are established in settings where one of the parameters is…

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…

We have identified the effect of the Wigner-Seitz cell geometry in the strong segregation limit of diblock copolymer melts with strong composition asymmetry. A variational problem is proposed describing the distortions of the chain paths…

We give a relation between the existence of a Zariski decomposition and the behavior of the restricted volume of a big divisor on a smooth (complex) projective variety. Moreover, we give an analytic description of the restricted volume in…

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

We use Salem's method to prove that there is a lower bound for partial sums of series of bi-orthogonal vectors in a Hilbert space, or the dual vectors. This is applied to some lower bounds on $L^{1}$ norms for orthogonal expansions. There…

We study properties of domain walls in the symmetron model, in which the scalar gravitational degree of freedom decouples from matter in regions of high density, and exhibits a spontaneously broken $Z_2$ symmetry at low densities. The…

We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.

We establish the first global results for groups definable in tame expansions of o-minimal structures. Let $\mathcal N$ be an expansion of an o-minimal structure $\mathcal M$ that admits a good dimension theory. The setting includes dense…

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…

There is a space of vector-valued nonsymmetric Jack polynomials associated with any irreducible representation of a symmetric group. Singular polynomials for the smallest singular values are constructed in terms of the Jack polynomials. The…

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…