English
Related papers

Related papers: Relations between counting functions on free group…

200 papers

We establish a formal correspondence between resource calculi an appropriate linear multicategories. We consider the cases of (symmetric) representable, symmetric closed and autonomous multicategories. For all these structures, we prove…

Logic in Computer Science · Computer Science 2023-07-28 Federico Olimpieri

We explore the existence of homomorphisms between outer automorphism groups of free groups Out(F_n) \to Out(F_m). We prove that if n > 8 is even and n \neq m \leq 2n, or n is odd and n \neq m \leq 2n - 2, then all such homomorphisms have…

Group Theory · Mathematics 2011-08-01 Martin R. Bridson , Karen Vogtmann

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

Combinatorics · Mathematics 2025-07-14 Tristram Bogart , Kevin Woods

In this article is studied the construction of free operads functor, for the symmetric and non-symmetric case. In order to do this, the operads are seen as monoids on the differential graded modules category. In the last part we show some…

Category Theory · Mathematics 2020-05-15 Jesus Sanchez-Guevara

Two rational functions $f,g\in\Bbb F_q(X)$ are said to be {\em equivalent} if there exist $\phi,\psi\in\Bbb F_q(X)$ of degree one such that $g=\phi\circ f\circ\psi$. We give an explicit formula for the number of equivalence classes of…

Number Theory · Mathematics 2025-06-27 Xiang-dong Hou

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

Group Theory · Mathematics 2014-03-24 Goulnara Arzhantseva , Jean-Francois Lafont , Ashot Minasyan

We present some thoughts on the relation between symmetric Schur-class functions on the bidisk and Schur-class functions on the symmetrized bidisk. Among other things, use of this relation leads to a finite dimensional realization result…

Functional Analysis · Mathematics 2026-01-22 Radomił Baran , Hugo J. Woerdeman

For each $2 \leq n \leq \infty$, we construct an uncountable family of free ergodic measure preserving actions $\alpha_t$ of the free group $\Bbb F_n$ on the standard probability space $(X, \mu)$ such that any two are non orbit equivalent…

Group Theory · Mathematics 2007-05-23 Damien Gaboriau , Sorin Popa

We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…

Information Theory · Computer Science 2025-07-29 Hassan Ou-azzou , Anna-Lena Horlemann , Nuh Aydin

This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…

Combinatorics · Mathematics 2010-05-25 Natalia Vanetik

We establish a set of relations between several quite diverse types of weighted inequalities involving various integral operators and fairly general quasinorm-like functionals which we call sub-monotone. The main result enables one to solve…

Classical Analysis and ODEs · Mathematics 2025-03-13 Amiran Gogatishvili , Luboš Pick

We generalize free monoids by defining $k$-monoids. These are nothing other than the one-vertex higher-rank graphs used in $C^{\ast}$-algebra theory with the cardinality requirement waived. The $1$-monoids are precisely the free monoids. We…

Category Theory · Mathematics 2024-06-04 M. V. Lawson , A. Vdovina

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

Group Theory · Mathematics 2021-05-26 Pierre Fima , Soyoung Moon , Yves Stalder

We refine the construction of quasi-homomorphisms on mapping class groups. It is useful to know that there are unbounded quasi-homomorphisms which are bounded when restricted to particular subgroups since then one deduces that the mapping…

Group Theory · Mathematics 2007-05-23 Mladen Bestvina , Koji Fujiwara

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

Group Theory · Mathematics 2019-03-26 Tara Brough , Alan J. Cain , Markus Pfeiffer

We consider a toy model of a 3-dimensional topological quantum gravity. In this model, a contribution of a given 3-manifold is given by the partition function of an abelian Topological Quantum Field Theory (TQFT), with a topological…

High Energy Physics - Theory · Physics 2025-08-05 Thomas Nicosanti , Pavel Putrov

There are different notions of computation, the most popular being monads, applicative functors, and arrows. In this article we show that these three notions can be seen as monoids in a monoidal category. We demonstrate that at this level…

Logic in Computer Science · Computer Science 2014-06-19 Exequiel Rivas , Mauro Jaskelioff

For any finitely generated group $G$, two complexity functions $\alpha_G$ and $\beta_G$ are defined to measure the maximal possible gap between the norm of an automorphism (respectively outer automorphism) of $G$ and the norm of its…

Group Theory · Mathematics 2015-02-06 Manuel Ladra , Pedro V. Silva , Enric Ventura

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Logic · Mathematics 2011-12-05 Sy-David Friedman , Luca Motto Ros

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

Computational Complexity · Computer Science 2025-03-04 Alberto Larrauri , Stanislav Živný