English
Related papers

Related papers: Automorphisms of necklaces and sandpile groups

200 papers

We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…

Group Theory · Mathematics 2018-10-30 Paolo Bellingeri , Arnaud Bodin

The article considers the procedure of connection of graphs to the edges of a cyclic graph and its influence on the sandpile group of the graph thus obtained. A series of classes of graphs CH_n(a_1,...,a_n) is defined. Recurrent and…

Combinatorics · Mathematics 2013-10-15 I. A. Krepkiy

Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…

Combinatorics · Mathematics 2024-09-04 Victor Reiner , Dorian Smith

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

Combinatorics · Mathematics 2009-04-14 Julia Brown

We prove that the automorphism groups of simple polarized abelian varieties of odd prime dimension over finite fields are cyclic, and give a complete list of finite groups that can be realized as such automorphism groups.

Number Theory · Mathematics 2019-01-16 WonTae Hwang

We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.

Combinatorics · Mathematics 2011-08-16 Min Sha

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…

Computational Complexity · Computer Science 2015-04-03 Swastik Kopparty , Mrinal Kumar , Michael Saks

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Information Theory · Computer Science 2012-07-16 Kenza Guenda , T. Aaron Gulliver

It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…

Combinatorics · Mathematics 2026-04-22 Robert Dougherty-Bliss , Sergi Elizalde

The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to…

Combinatorics · Mathematics 2010-08-05 Mikhail Klin , István Kovács

We describe the automorphism groups of reductive monoids and of root monoids with active groups of invertible elements.

Algebraic Geometry · Mathematics 2026-05-13 Anton Shafarevich

The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following:…

Combinatorics · Mathematics 2007-05-23 Evelin Toumpakari

This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…

Dynamical Systems · Mathematics 2020-04-28 Bernhard Reinke

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

Number Theory · Mathematics 2007-05-23 Igor Rivin

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

Combinatorics · Mathematics 2020-06-24 Ali Sltan Ali AL-Tarimshawy , J. Siemons

We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…

Representation Theory · Mathematics 2024-11-26 Tyrone Crisp , Ehud Meir , Uri Onn

After having established elementary results on the relationship between a finite complex (pseudo-)reflection group W < GL(V) and its reflection arrangement A, we prove that the action of W on A is canonically related with other natural…

Representation Theory · Mathematics 2008-09-03 Ivan Marin

We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.

Rings and Algebras · Mathematics 2023-01-18 Oksana Bezushchak

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

Combinatorics · Mathematics 2009-03-23 Rolf Bienert , Benjamin Klopsch

This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…

Algebraic Geometry · Mathematics 2025-03-06 Sergei Kovalenko , Alexander Perepechko , Mikhail Zaidenberg
‹ Prev 1 2 3 10 Next ›