Related papers: VC-dimension of short Presburger formulas

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

Vector calculus in three-dimensional space is ubiquitous in applications of mathematics in physics and engineering. Its two-dimensional version is, however, quite rare. Here we try to provide a pedagogical account of the subject. It is…

Several upper bounds on the size of quantum codes are derived using the linear programming approach. These bounds are strengthened for the linear quantum codes.

We consider partially observed multiscale diffusion models that are specified up to an unknown vector parameter. We establish for a very general class of test functions that the filter of the original model converges to a filter of reduced…

We construct the quasi-classical approximation of the form factors in finite volume using the separation of variables. The latter is closely related to the Baxter equation.

In this short note, we show that the VC-dimension of the class of $k$-vertex polytopes in $\mathbb R^d$ is at most $8d^2k\log_2k$, answering an old question of Long and Warmuth.

Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful information about a set such as its cardinality. For set…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

The bounded variation seminorm and the Sobolev seminorm on compact manifolds are represented as a limit of fractional Sobolev seminorms. This establishes a characterization of functions of bounded variation and of Sobolev functions on…

We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of…

This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…

We produce a short and elementary algorithm to compute an upper bound for the canonical dimension of a spit semisimple linear algebraic group. Using this algorithm we confirm previously known bounds by Karpenko and Devyatov as well as we…

We show that the bicovariant first order differential calculi on a factorisable semisimple quantum group are in 1-1 correspondence with irreducible representations $V$ of the quantum group enveloping algebra. The corresponding calculus is…

We study the isoperimetric problem in product spaces equipped with the uniform distance. Our main result is a characterization of isoperimetric inequalities which, when satisfied on a space, are still valid for the product spaces, up a to a…

In "VC density in some theories without the independence property" the authors asked whether any partial order of finite width has the VC1 property (i.e. every formula in one variable has UDTFS in one parameter). We give a negative answer…

For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.

We refine upper bounds for the classical exponents of uniform approximation for a linear form on the Veronese curve in dimension from $3$ to $9$. For dimension three, this in particular shows that a bound previously obtained by two…

In this paper, we present a new estimator of the mean of a random vector, computed by applying some threshold function to the norm. Non asymptotic dimension-free almost sub-Gaussian bounds are proved under weak moment assumptions, using…

We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations…