Related papers: Measuring well quasi-ordered finitary powersets
Suppose x is any exactly k-sparse vector in R^n. We present a class of sparse matrices A, and a corresponding algorithm that we call SHO-FA (for Short and Fast) that, with high probability over A, can reconstruct x from Ax. The SHO-FA…
We discuss some applications of WQOs to several fields were hierarchies and reducibilities are the principal classification tools, notably to Descriptive Set Theory, Computability theory and Automata Theory. While the classical hierarchies…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable…
Using recent results of Berman and Boucksom we show that for a non-pluripolar compact set K in C^d and an admissible weight function w=e^{-\phi} any sequence of so-called optimal measures converges weak-* to the equilibrium measure…
Quasisymmetric stellarators are an attractive class of optimised magnetic confinement configurations. The property of quasisymmetry (QS) is in practice limited to be approximate, and thus the construction requires measures that quantify the…
The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\geq 3$ to test…
The preparation of long-range entangled states using unitary circuits is limited by Lieb-Robinson bounds, but circuits with projective measurements and feedback (``adaptive circuits'') can evade such restrictions. We introduce three classes…
Transformations of well partial orders induce functions on the ordinals, via the notion of maximal order type. In most examples from the literature, these functions are not normal, in marked contrast with the central role that normal…
We consider measures which are invariant under a measurable iterated function system with positive, place-dependent probabilities in a separable metric space. We provide an upper bound of the Hausdorff dimension of such a measure if it is…
We consider various incommensurate (IC) order parameters for electrons on a square lattice which reduce to $d_{x^2-y^2}$-density wave (DDW) order when the ordering wavevector ${\bf Q}\to (\pi,\pi)$. We describe the associated charge and…
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…
Entanglement is one of the fundamental properties of a quantum state and is a crucial differentiator between classical and quantum computation. There are many ways to define entanglement and its measure, depending on the problem or…
We consider the pointwise approximation of a subharmonic function by the logarithm of the modulus of an entire function up to a bounded quantity. In the case of finite order an estimate from below of the planar Lebesgue measure of an…
Local structure characterization with the bond-orientational order parameters q4, q6, ... introduced by Steinhardt et al. has become a standard tool in condensed matter physics, with applications including glass, jamming, melting or…
The ergodic unitarily invariant measures on the space of infinite Hermitian matrices have been classified by Pickrell and Olshanski-Vershik. The much-studied complex inverse Wishart measures form a projective family, thus giving rise to a…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
We study the Fourier transform of polynomials in an orthogonal family, taken with respect to the orthogonality measure. Mastering the asymptotic properties of these transforms, that we call Fourier--Bessel functions, in the argument, the…