English
Related papers

Related papers: Is being a higher rank lattice a first order prope…

200 papers

The classical zero-one law for first-order logic on random graphs says that for any first-order sentence $\phi$ in the theory of graphs, as n approaches infinity, the probability that the random graph G(n, p) satisfies $\phi$ approaches…

Combinatorics · Mathematics 2009-04-17 Phokion G. Kolaitis , Swastik Kopparty

Given a group $G$ and an automorphism $\varphi$ of $G$, two elements $x, y \in G$ are said to be $\varphi$-conjugate if $x = g y \varphi(g)^{-1}$ for some $g \in G$. The number of equivalence classes is the Reidemeister number $R(\varphi)$…

Group Theory · Mathematics 2021-05-05 Karel Dekimpe , Pieter Senden

If $\Gamma$ is a string C-group which is isomorphic to a transitive subgroup of the symmetric group Sym(n) (other than Sym(n) and the alternating group Alt(n)), then the rank of $\Gamma$ is at most $n/2+1$, with finitely many exceptions…

Group Theory · Mathematics 2014-10-23 Peter J. Cameron , Maria Elisa Fernandes , Dimitri Leemans , Mark Mixer

Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…

Combinatorics · Mathematics 2020-11-12 Mohammad A. Iranmanesh , Nasrin Moghaddami

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Combinatorics · Mathematics 2020-09-01 Thomas McConville , Bruce E. Sagan , Clifford Smyth

We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…

Group Theory · Mathematics 2018-07-20 Uri Bader , Alex Furman , Roman Sauer

A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…

Combinatorics · Mathematics 2022-12-20 Josef Rukavicka

We prove the equality $\cat(\phi)=\cd(\phi)$ for homomorphisms $\phi:\Gamma\to \Lambda$ of a torsion free finitely generated nilpotent groups $\Gamma$ to an arbitrary group $\Lambda$. We construct an epimorphism $\psi:G\to H$ between…

Algebraic Topology · Mathematics 2022-03-09 Alexander Dranishnikov , Nursultan Kuanyshov

Given a cyclic group $G$ of order $p^r$, where $p$ is a prime and $r\in\mathbb{N}$. It is well-known that the order of its greatest proper subgroup $\psi(G)$ and the number of its generators $\phi(G)$ satisfy $\psi(G)+\phi(G)=p^r$. In this…

General Mathematics · Mathematics 2019-12-17 Mohsen Aliabadi

Let $L$ be a complete discrete valuation field of prime characteristic $p$ with finite residue field. Denote by $\Gamma _{L}^{(v)}$ the ramification subgroups of $\Gamma _{L}=\operatorname{Gal}(L^{sep}/L)$. We consider the category…

Number Theory · Mathematics 2022-11-23 Victor Abrashkin

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

Rings and Algebras · Mathematics 2016-01-12 Eva Bayer-Fluckiger , Uriya A. First

Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…

Logic · Mathematics 2019-06-27 Dominic J. D. Hughes

If $\Gamma$ is any nonuniform lattice in the group ${\rm PU}(2,1)$, let $\overline{\Gamma}$ be the quotient of $\Gamma$ obtained by filling the cusps of $\Gamma$ (i.e. killing the center of parabolic subgroups). Assuming that such a lattice…

Geometric Topology · Mathematics 2017-03-29 Pierre Py

Let $G$ be a group with identity element $e$, and suppose that $S$ is an associative $G$-graded ring that is not necessarily unital. In the case where $G$ is an ordered group, we show that a graded ideal is prime if and only if it is graded…

Rings and Algebras · Mathematics 2025-10-31 Daniel Lännström , Patrik Lundström , Johan Öinert , Stefan Wagner

Let G be a finite group acting orthogonally on a pair (S^d,\Gamma) where \Gamma is a finite, connected graph of genus g>1 embedded in the sphere S^d. The 3-dimensional case d=3 has recently been considered in a paper by C. Wang, S. Wang, Y.…

Geometric Topology · Mathematics 2017-06-19 Bruno P. Zimmermann

We investigate the relationship between axiomatic set theory and the first-order theory of homeomorphism groups of manifolds in the language of group theory, concentrating on first-order rigidity and type versus conjugacy. We prove that…

Geometric Topology · Mathematics 2025-12-08 James E. Hanson , Thomas Koberda , J. de la Nuez González , Christian Rosendal

Let $\phi:G\to G$ be an automorphism of an infinite group $G$. One has an equivalence relation $\sim_\phi$ on $G$ defined as $x\sim_\phi y$ if there exists a $z\in G$ such that $y=zx\phi(z^{-1})$. The equivalence classes are called…

Group Theory · Mathematics 2022-02-22 Oorna Mitra , Parameswaran Sankaran

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

Group Theory · Mathematics 2026-01-06 D. L. Flannery , A. E. Zalesski

Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…

Group Theory · Mathematics 2025-10-03 Claudio Llosa Isenrich , Eduard Schesler , Xiaolei Wu

We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.

Group Theory · Mathematics 2010-09-08 B. M. Vernikov