English
Related papers

Related papers: A Generalization of Redfield's Master Theorem

200 papers

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

Dickson's commutative semifields are an important class of finite division algebras. We generalise Dickson's construction of commutative division algebras by doubling both finite field extensions and central simple algebras and not…

Rings and Algebras · Mathematics 2019-03-01 Daniel Thompson

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

Statistical Mechanics · Physics 2009-08-13 M. E. J. Newman

The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…

Group Theory · Mathematics 2021-05-14 Ihechukwu Chinyere , Gerald Williams

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…

Combinatorics · Mathematics 2017-10-12 Amin Bahmanian , Chris Rodger

We prove a generalized version of Renault's theorem for Cartan subalgebras. We show that the original assumptions of second countability and separability are not needed. This weakens the assumption of topological principality of the…

Operator Algebras · Mathematics 2022-02-01 Ali Imad Raad

In this paper, we study two compactifications of general hypersurfaces defined by the vanishing of linear combinations of $d+2$ monomials in $d$-dimensional algebraic tori. We prove that the number of their $\mathbb{F}_q$-points is given by…

Number Theory · Mathematics 2025-09-23 Asem Abdelraouf

Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…

Dynamical Systems · Mathematics 2022-02-01 Xuan Kien Phung

We show a general theorem of existence of temporal foliations in a general causal set, under mild constraints. Then we study automorphisms of infinite causal sets (which satisfy further requirements) and show that they fall under one of two…

General Relativity and Quantum Cosmology · Physics 2020-10-02 Ali Bleybel , Abdallah Zaiour

We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…

Metric Geometry · Mathematics 2015-03-13 Samuel Frank , Jiayang Jiang

In this paper we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$…

Combinatorics · Mathematics 2014-10-23 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…

Group Theory · Mathematics 2015-04-02 Mário J. J. Branco , Gracinda M. S. Gomes , Pedro V. Silva

Classical Clifford theory studies the decomposition of simple $G$-modules into simple $H$-modules for some normal subgroup $H \triangleleft G$. In this paper we deal with chains of normal subgroups $1 \triangleleft G_1 \triangleleft \cdots…

Representation Theory · Mathematics 2017-06-13 Frederik Caenepeel , Fred Van Oystaeyen

We show that on the four-symbol full shift, there is a finitely generated subgroup of the automorphism group whose action is (set-theoretically) transitive of all orders on the points of finite support, up to the necessary caveats due to…

Dynamical Systems · Mathematics 2018-03-01 Ville Salo

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

Group Theory · Mathematics 2024-03-19 Romain Tessera , Matthew Tointon

The mapping class group of a surface with one boundary component admits numerous interesting representations including as a group of automorphisms of a free group and as a group of symplectic transformations. Insofar as the mapping class…

Geometric Topology · Mathematics 2009-06-01 Jorgen Ellegaard Andersen , Alex James Bene , R. C. Penner

We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…

Dynamical Systems · Mathematics 2022-12-15 Aurelia Dymek , Stanisław Kasjan , Gerhard Keller

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

Combinatorics · Mathematics 2018-04-09 Asaf Ferber , Vishesh Jain

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

Logic · Mathematics 2017-04-18 Anush Tserunyan