Search
Search Results
-
Correction to: Flag-transitive block designs and unitary groups
A Correction to this paper has been published: https://doi.org/10.1007/s00605-020-01421-8
-
Two-geodesic-transitive Graphs and Vertex-transitive Diameter Two Hexavalent Graphs
In this paper, we first investigate the family of vertex-transitive diameter 2 hexavalent graphs and particularly completely determine such graphs...
-
Vertex-transitive Diameter Two Graphs
We investigate the family of vertex-transitive graphs with diameter 2. Let Γ be such a graph. Suppose that its automorphism group is transitive on...
-
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action
Baker and Wang define the so-called Bernardi action of the sandpile group of a ribbon graph on the set of its spanning trees. This potentially...
-
Highly-Arc-Transitive and Descendant-Homogeneous Digraphs with Finite Out-Valency
We investigate infinite highly-arc-transitive digraphs with two additional properties, property Z and descendant-homogeneity. We show that if D is a...
-
Geometry of Permutation Limits
This paper initiates a limit theory of permutation valued processes, building on the recent theory of permutons. We apply this to study the...
-
Pentavalent vertex-transitive diameter two graphs
We classify the family of pentavalent vertex-transitive graphs Γ with diameter 2. Suppose that the automorphism group of Γ is transitive on the set...
-
Increasing Tableaux, Narayana Numbers and an Instance of the Cyclic Sieving Phenomenon
We give a counting formula for the set of rectangular increasing tableaux in terms of generalized Narayana numbers. We define small m –Schröder paths...
-
Linear closures of finite geometries
The interrelations between finite geometries (finite incidence structures) and linear codes over finite fields are discussed under some special...
-
Symmetries on the Lattice of k-Bounded Partitions
In
2002 , Suter [25 ] identified a dihedral symmetry on certain order ideals in Young’s lattice and gave a combinatorial action on the partitions in... -
Refined Enumeration of Noncrossing Chains and Hook Formulas
In the combinatorics of finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a...
-
A Generalization of Euler Numbers to Finite Coxeter Groups
It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the...
-
Rational Parking Functions and Catalan Numbers
The “classical” parking functions, counted by the Cayley number ( n +1) n −1 , carry a natural permutation representation of the symmetric group S ...
-
Cayley graphs on abelian groups
Let A be an abelian group and let ι be the automorphism of A defined by: ι: a ↦ a −1 . A Cayley graph Γ = Cay( A,S ) is said to have an automorphism...
-
The configurations 123 revisited
As is known, there are 229 symmetric configurations 12 3 , (Daublebsky von Sterneck in Monatshefte Math Phys 5:223–255,
1895 ; Gropp in J Comb Inf Syst... -
Algebras That Represent Steiner Systems Through Permutation Groups
Each finite, sharply multiply transitive group of permutations of transitivity t and degree d (2 ≤ t < d ) leads to a partial algebra, called a...
-
Binary codes and partial permutation decoding sets from the odd graphs
For k ≥ 1, the odd graph denoted by O( k ), is the graph with the vertex-set Ω { k } , the set of all k -subsets of Ω = {1, 2, …, 2 k +1}, and any two of its...
-
Abelian Carter subgroups in finite permutation groups
We show that a finite permutation group containing a regular abelian self-normalizing subgroup is soluble.
-
On fixing boundary points of transitive hyperbolic graphs
We show that there is no one-ended, locally finite, planar, hyperbolic graph such that the stabilizer of one of its hyperbolic boundary points acts...