Related papers: Constraint metric approximations and equations in …

We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…

We start with a small paradigm shift about group representations, namely the observation that restriction to a subgroup can be understood as an extension-of-scalars. We deduce that, given a group $G$, the derived and the stable categories…

We prove uniform boundedness of certain boundary representations on appropriate fractional Sobolev spaces $W^{s,p}$ with $p>1$ for arbitrary Gromov hyperbolic groups. These are closed subspaces of $L^p$ and in particular Hilbert spaces in…

We introduce a notion of local Hilbert--Schmidt stability, motivated by the recent definition by Bradford of local permutation stability, and give examples of (non-residually finite) groups that are locally Hilbert--Schmidt stable but not…

For any odd prime $p$ we consider representations of a group of order $p$ in the symplectic group $Sp(p-1,Z[1/n])$ of $(p-1)\times(p-1)$-matrices over the ring $Z[1/n]$, $0\neq n\in N$. We construct a relation between the conjugacy classes…

We develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…

Consider $\operatorname{Sym}(n)$, endowed with the normalized Hamming metric $d_n$. A finitely-generated group $\Gamma$ is \emph{P-stable} if every almost homomorphism $\rho_{n_k}\colon \Gamma\rightarrow\operatorname{Sym}(n_k)$ (i.e., for…

Stability and error analysis remain challenging for problems that lack regularity properties near solutions, are subject to large perturbations, and might be infinite dimensional. We consider nonconvex optimization and generalized equations…

We study a variant of classical clustering formulations in the context of algorithmic fairness, known as diversity-aware clustering. In this variant we are given a collection of facility subsets, and a solution must contain at least a…

Capacitated fair-range $k$-clustering generalizes classical $k$-clustering by incorporating both capacity constraints and demographic fairness. In this setting, each facility has a capacity limit and may belong to one or more demographic…

We establish a result which states that regularizing an inverse problem with the gauge of a convex set $C$ yields solutions which are linear combinations of a few extreme points or elements of the extreme rays of $C$. These can be…

In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP($\mathcal{C}$,-), in which the goal is, given a relational structure $\mathbf{A}$ from a class $\mathcal{C}$ of structures and an…

Regarding the conjugacy representation on symmetric groups, we initiate a normalized measure emerging from this representation, namely the conjugacy measure. A central limit theorem for character ratios of random representations of the…

Let $\mathcal{C}$ be a smooth, projective and geometrically integral curve defined over a finite field $\mathbb{F}$. Let $A$ be the ring of function of $\mathcal{C}$ that are regular outside a closed point $P$ and let $k=\mathrm{Quot}(A)$.…

In 2010, the first author of this paper introduced the notion of $\sigma$--stability for a nonempty subset of an $L^0(\mathcal{F},K)$--module in [T.X. Guo, Relations between some basic results derived from two kinds of topologies for a…

We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…

We introduce the notion of stable representations, -- it is a new class of the representations of a certain class of groups which defined with positive definite functions which generalize the classical notion of the characters (or trace).…

In this note the smooth (i.e. with open stabilizers) linear and {\sl semilinear} representations of certain permutation groups (such as infinite symmetric group or automorphism group of an infinite-dimensional vector space over a finite…

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

CSP sparsification, introduced by Kogan and Krauthgamer (ITCS 2015), considers the following question: how much can an instance of a constraint satisfaction problem be sparsified (by retaining a reweighted subset of the constraints) while…