Related papers: Constraint metric approximations and equations in …
Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have…
We provide a general framework to construct finite dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give estimates…
We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group $S_n$ and are consistent as $n$ varies. The extreme infinitely spherically symmetric permutation-valued processes are identified…
We study p-adic counterparts of stable distributions, that is limit distributions for sequences of normalized sums of independent identically distributed p-adic-valued random variables. In contrast to the classical case, non-degenerate…
We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…
In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…
We describe symmetry structure of a general singular theory (theory with constraints in the Hamiltonian formulation), and, in particular, we relate the structure of gauge transformations with the constraint structure. We show that any…
Let $k$ be a number field and $X$ a smooth integral affine variety equipped with a morphism $f : X \to A^1_k$ to the affine line. Assume that all fibres of $f$ are split, for instance that they are geometrically integral. Assume that the…
We are concerned with unbounded sets of $\mathbb{R}^N$ whose boundary has constant nonlocal (or fractional) mean curvature, which we call CNMC sets. This is the equation associated to critical points of the fractional perimeter functional…
We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…
We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…
We consider (projectively) linearly sofic groups, i.e. groups which can be approximated using (projective) matrices over arbitrary fields, as a generalization of sofic groups. We generalize known results for sofic groups and groups which…
We investigated the asymptotics of high-rate constrained quantization errors for a compactly supported probability measure P on Euclidean spaces whose quantizers are confined to a closed set S. The key tool is the metric projection of K…
The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…
We make some general remarks on long-ranged configurations in gauge or diffeomorphism invariant theories where the fields are allowed to assume some non vanishing values at spatial infinity. In this case the Gauss constraint only eliminates…
A function $f: \mathbb{Z} \to \mathbb{Q}^n$ is a $c$-quasihomomorphism if the Hamming distance between $f(x+y)$ and $f(x)+f(y)$ is at most $c$ for all $x,y \in \mathbb{Z}$. We show that any $c$-quasihomomorphism has distance at most some…
We treat the convergence of Carleman linearization of nonlinear evolutionary equations through the approximation theory of strongly continuous semigroups, by Carleman embedding the underlying nonlinear semigroups as linear semigroups.…
A countable group G is called k-linear sofic (for some 0 <k \le 1) if finite subsets of G admit "approximate representations" by complex invertible matrices in the normalized rank metric, so that non-identity elements are k-away from the…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…
This paper introduces a notion of categorical approximability for metric spaces that can be viewed as a categorification of approximability for metric groups, as defined by Turing in 1938. Approximability as introduced here is a property of…