English
Related papers

Related papers: The cogrowth inequality from Whitehead's algorithm

200 papers

We use Gersten's generalization of Whitehead's algorithm to determine whether a given finitely generated subgroup of a free group $F$ is elliptic in an elementary cyclic splitting of $F$. We provide a similar result for all elementary…

Group Theory · Mathematics 2023-11-06 Brent B. Solie

The interpolated free group factors L(F_r), 1 < r <= \infty, are defined and proofs of their properties with respect to compression by projections and taking free products are proved. Hence it follows that all the free group factor are…

funct-an · Mathematics 2008-02-03 Ken Dykema

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…

Group Theory · Mathematics 2025-12-23 Arjun Agarwal , Rachel Chen , Rohan Garg , Jared Kettinger

Bestvina-Feighn-Handel show that for finitely many generic and independent hyperbolic automorphisms $\phi_1, \cdots, \phi_r$ of $F_n$, the resulting extension $F_n \rtimes F_r$ is hyperbolic. This paper generalizes the above statement to…

Group Theory · Mathematics 2026-04-22 SK Kiran Ajij

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let \phi_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that…

Combinatorics · Mathematics 2011-09-13 Peter Allen , Julia Böttcher , Yury Person

We call a family of $s$ sets $\{F_1, \ldots, F_s\}$ a \textit{sunflower with $s$ petals} if, for any distinct $i, j \in [s]$, one has $F_i \cap F_j = \cap_{u = 1}^s F_u$. The set $C = \cap_{u = 1}^s F_u$ is called the {\it core} of the…

Combinatorics · Mathematics 2025-04-23 Andrey Kupavskii , Fedor Noskov

For a graph $G$ and a set of graphs $\mathcal{H}$, we say that $G$ is {\em $\mathcal{H}$-free} if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Given an integer $P>0$, a graph $G$, and a set of graphs $\mathcal{F}$,…

Combinatorics · Mathematics 2013-02-05 Maria Chudnovsky , Alex Scott , Paul Seymour

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL). The instances of this…

Computational Complexity · Computer Science 2008-02-05 Tommy Färnqvist , Peter Jonsson , Johan Thapper

Let $V$ be a finite-dimensional vector space over the field with $p$ elements, where $p$ is a prime number. Given arbitrary $\alpha,\beta\in \mathrm{GL}(V)$, we consider the semidirect products $V\rtimes\langle \alpha\rangle$ and…

Group Theory · Mathematics 2025-03-19 Volker Gebhardt , Alberto J. Hernandez Alvarado , Fernando Szechtman

The requirement for solving nonlinear algebraic equations is ubiquitous in the field of electric power system simulations. While Newton-based methods have been used to advantage, they sometimes do not converge, leaving the user wondering…

Systems and Control · Electrical Eng. & Systems 2020-04-17 Songyan Li , Abhinav Dronamraju , Daniel Tylavsky

Let $G$ be a graph and $\mathcal{F}$ a family of graphs. Define $\alpha_{\mathcal{F}}(G)$ as the maximum order of any induced subgraph of $G$ that belongs to the family $\mathcal{F}$. For the family $\mathcal{F}$ of graphs with…

Combinatorics · Mathematics 2026-05-12 Yair Caro , Randy Davila , Michael A. Henning , Ryan Pepper

We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make…

Logic in Computer Science · Computer Science 2015-07-01 Martin Huschenbett , Alexander Kartzow , Jiamou Liu , Markus Lohrey

We consider the triple $(\mathcal{A},\mathcal{A}',\mathcal{A}^H)$ of hyperplane arrangements and the division of their characteristic polynomials. We show that the freeness of $\mathcal{A}^H$ and the division of $\chi(\mathcal{A};t)$ by…

Commutative Algebra · Mathematics 2017-01-18 Takuro Abe

For $k \ge 1$ we consider the $K$-algebra $H(k) := H(C,kD,\Omega)$ associated to a symmetrizable Cartan matrix $C$, a symmetrizer $D$, and an orientation $\Omega$ of $C$, which was defined in Part 1. We construct and analyse a reduction…

Representation Theory · Mathematics 2018-05-17 Christof Geiss , Bernard Leclerc , Jan Schröer

We investigate the relationship between geometric, analytic and probabilistic indices for quotients of the Cayley graph of the free group ${\rm Cay}(F_n)$ endowed with variable edge lengths, by an arbitrary subgroup $G$ of $F_n$. Our main…

Dynamical Systems · Mathematics 2018-02-26 Johannes Jaerisch , Katsuhiko Matsuzaki

Let $G$ be the mapping torus of a polynomially growing automorphism of a finitely generated free group. We determine which epimorphisms from $G$ to $\mathbb{Z}$ have finitely generated kernel, and we compute the rank of the kernel. We thus…

Group Theory · Mathematics 2016-06-23 Christopher H. Cashen , Gilbert Levitt

The PC algorithm infers causal relations using conditional independence tests that require a pre-specified Type I $\alpha$ level. PC is however unsupervised, so we cannot tune $\alpha$ using traditional cross-validation. We therefore…

Machine Learning · Statistics 2020-12-23 Eric V. Strobl

We construct a correspondence between epimorphisms $\varphi \colon \pi_1(M) \to F_r$ from the fundamental group of a compact manifold $M$ onto the free group of rank $r$, and systems of $r$ framed non-separating hypersurfaces in $M$, which…

Geometric Topology · Mathematics 2025-05-29 Wacław Marzantowicz , Łukasz Patryk Michalak

Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a…

Group Theory · Mathematics 2025-02-19 Matan Seidel , Danielle Ernst-West , Doron Puder

In 1987 Hiroshi Maehara conjectured that a graph can be represented by vectors considered adjacent when not orthogonal (a faithful orthogonal representation) in codimension the minimum degree of the graph. Without settling the conjecture,…

Combinatorics · Mathematics 2026-01-06 H. Tracy Hall
‹ Prev 1 8 9 10 Next ›