Results 31 to 40 of about 776 (182)
Character deflations and a generalization of the Murnaghan--Nakayama rule [PDF]
, 2014 Given natural numbers m and n, we define a deflation map from the characters of the symmetric group S_{mn} to the characters of S_n. This map is obtained by first restricting a character of S_{mn} to the wreath product S_m ?S_n, and then taking the ...
Evseev, Anton +3 more
core +1 more source
Promotion of Lattice Paths by Riordan Arrays
MathematicsThis paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion.
Aoife Hennessy +3 more
doaj +1 more source
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, EarlyView.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
Enumerative Combinatorics in the Partition Lattice [PDF]
, 2009 The focus of this thesis lies on the application of enumerative combinatorics to the partition lattice n. Some ideas beyond enumerative combinatorics are used to examine the lattice properties of n.
Simon, Frank
core
Structure and Combinatorics on Right Groups
MathematicsRight groups form an important bridge between group theory and semigroup theory, combining the algebraic symmetry of groups with the one-sided structure of right zero semigroups.
Aftab Hussain Shah +2 more
doaj +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Forum of Mathematics, SigmaAn ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
Enumerative combinatorics on words
, 2015 International audienceCombinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory.
Restivo, Antonio, Perrin, Dominique
core +1 more source
On Strongly and Robustly Critical Graphs
Journal of Graph Theory, Volume 112, Issue 4, Page 469-483, August 2026.ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k‐critical yet L‐colorable with respect to ...
Anton Bernshteyn +3 more
wiley +1 more source