相关论文: Improved stability for the size and structure of s…

We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…

The study of complex systems has attracted widespread attention from researchers in the fields of natural sciences, social sciences, and engineering. Prediction is one of the central issues in this field. Although most related studies have…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

A set $P\subset \mathbb N$ is called predictive if for any zero entropy finite-valued stationary process $(X_i)_{i\in \mathbb Z}$, $X_0$ is measurable with respect to $(X_i)_{i\in P}$. We know that $\mathbb N$ is a predictive set. In this…

In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of $[1,n]$ with lowest value in $\left [\frac{n}{3},\frac{n}{2}\right ]$, and the identification of…

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

We study the stability and stabilizability of a continuous-time switched control system that consists of the time-invariant $n$-dimensional subsystems \dot{x}=A_ix+B_i(x)u\quad (x\in\mathbb{R}^n, t\in\mathbb{R}_+ \textrm{and}…

We describe in this paper additively left stable sets, i.e. sets satisfying $\left((A+A)-\inf(A)\right)\cap[\inf(A),\sup(A)]=A$ (meaning that $A-\inf(A)$ is stable by addition with itself on its convex hull), when $A$ is a finite subset of…

The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…

The structured singular value $\mu$ was introduced independently by Doyle and Safanov as a tool for analyzing robustness of system stability and performance in the presence of structured uncertainty in the system parameters. While the…

We consider overdetermined systems of difference equations for a single function $u$ which are consistent, and propose a general framework for their analysis. The integrability of such systems is defined as the existence of higher order…

The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…

For a subset A of a finite abelian group G we define Sigma(A)={sum_{a\in B}a:B\subset A}. In the case that Sigma(A) has trivial stabiliser, one may deduce that the size of Sigma(A) is at least quadratic in |A|; the bound |Sigma(A)|>=…

This paper revisits a fundamental problem in statistical inference from a non-asymptotic theoretical viewpoint $\unicode{x2013}$ the construction of confidence sets. We establish a finite-sample bound for the estimator, characterizing its…

We prove strong statistical stability of a large class of one-dimensional maps which may have an arbitrary finite number of discontinuities and of non-degenerate critical points and/or singular points with infinite derivative, and satisfy…

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.

Confidence sets based on sparse estimators are shown to be large compared to more standard confidence sets, demonstrating that sparsity of an estimator comes at a substantial price in terms of the quality of the estimator. The results are…

We find the bounds of the size of the union of n sets satisfying the condition that the intersection of any k sets is empty. We show that any number between the upper and lower bounds can be realised, and in the measure version, the…