Related papers: Degree of satisfiability of some special equations

We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle…

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

Factor graph of an instance of a constraint satisfaction problem with n variables and m constraints is the bipartite graph between [m] and [n] describing which variable appears in which constraints. Thus, an instance of a CSP is completely…

In this paper, we consider an equivalence relation within the class of finitely presented discrete groups attending to their asymptotic topology rather than their asymptotic geometry. More precisely, we say that two finitely presented…

For a finite nonabelian group $G$ let $\rat(G)$ be the largest ratio of degrees of two nonlinear irreducible characters of $G$. We show that nonabelian composition factors of $G$ are controlled by $\rat(G)$ in some sense. Specifically, if…

Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…

We consider robust covariance estimation with group symmetry constraints. Non-Gaussian covariance estimation, e.g., Tyler scatter estimator and Multivariate Generalized Gaussian distribution methods, usually involve non-convex minimization…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

Given a group $G$ with bounded torsion that acts properly on a systolic complex, we show that every solvable subgroup of $G$ is finitely generated and virtually abelian of rank at most $2$. In particular this gives a new proof of the above…

A group G is (finitely) co-Hopfian if it does not contain any proper (finite-index) subgroups isomorphic to itself. We study finitely generated groups G that admit a descending chain of proper normal finite-index subgroups, each of which is…

The classes of electrovacuum Einstein - Maxwell fields (with a cosmological constant), which metrics admit an Abelian two-dimensional isometry group $\mathcal{G}_2$ with non-null orbits and electromagnetic fields possess the same symmetry,…

We prove that every countable acylindrically hyperbolic group admits a highly transitive action with finite kernel. This theorem uniformly generalizes many previously known results and allows us to answer a question of Garion and Glassner…

An outstanding problem in statistical mechanics is the determination of whether prescribed functional forms of the pair correlation function $g_2(r)$ [or equivalently, structure factor $S(k)$] at some number density $\rho$ can be achieved…

A group $G$ is called to be acceptable (due to M. Larsen) if for any finite group $H$, two element-conjugate homomorphisms are globally conjugate. We answer the acceptability question for general linear, special linear, unitary, symplectic…

We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…

We establish a characterization of amenability for general Hausdorff topological groups in terms of matchings with respect to finite uniform coverings. Furthermore, we prove that it suffices to just consider two-element uniform coverings.…

It is known that if every group satisfying an identity of the form yx ~ xU(x,y)y is abelian, so is every semigroup that satisfies that identity. Because a group has an identity element and the cancellation property, it is easier to show…

This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…

Given an implicit $n\times n$ matrix $A$ with oracle access $x^TA x$ for any $x\in \mathbb{R}^n$, we study the query complexity of randomized algorithms for estimating the trace of the matrix. This problem has many applications in quantum…

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…