Results 11 to 20 of about 4,246 (261)
The topology of restricted partition posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π ^• _{\vec{c}}$ is a wedge of $β\vec{c}$ spheres of the same dimensions, where $β\vec{c}$ is the number of permutations with descent composition ^$\vec{
Richard Ehrenborg, JiYoon Jung
doaj +1 more source
Boltzmann Complexity: An Emergent Property of the Majorization Partial Order
Entropy, 2016 Boltzmann macrostates, which are in 1:1 correspondence with the partitions of integers, are investigated. Integer partitions, unlike entropy, uniquely characterize Boltzmann states, but their use has been limited.
William Seitz, A. D. Kirwan
doaj +1 more source
Gluing two affine Yangians of 𝔤𝔩1
Journal of High Energy Physics, 2019 We construct a four-parameter family of affine Yangian algebras by gluing two copies of the affine Yangian of 𝔤𝔩1. Our construction allows for gluing operators with arbitrary (integer or half integer) conformal dimension and arbitrary (bosonic or ...
Wei Li, Pietro Longhi
doaj +1 more source
Parallel Rank of Two Sandpile Models of Signed Integer Partitions
Journal of Applied Mathematics, 2013 We introduce the concept of fundamental sequence for a finite graded poset X which is also a discrete dynamical model. The concept of fundamental sequence is a refinement of the concept of parallel convergence time for these models.
G. Chiaselotti +3 more
doaj +1 more source
A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES
Forum of Mathematics, Sigma, 2019 Our main result establishes Andrews’ conjecture for the asymptotic of the generating function for the number of integer partitions of $n$ without $k$ consecutive parts.
DANIEL M. KANE, ROBERT C. RHOADES
doaj +1 more source
A phase transition in the distribution of the length of integer partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We assign a uniform probability to the set consisting of partitions of a positive integer $n$ such that the multiplicity of each summand is less than a given number $d$ and we study the limiting distribution of the number of summands in a random ...
Dimbinaina Ralaivaosaona
doaj +1 more source
MathematicsBrauer configuration algebras are path algebras induced by appropriated multiset systems. Since their structures underlie combinatorial data, the general description of some of their algebraic invariants (e.g., their dimensions or the dimensions of their
Agustín Moreno Cañadas +2 more
doaj +1 more source
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
Theory and Applications of Graphs, 2018 We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly $k$-connected ...
Kai Wang
doaj +1 more source
A Nekrasov-Okounkov type formula for affine $\widetilde{C}$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$.
Mathias Pétréolle
doaj +1 more source
Generating binomial coefficients in a row of Pascal's triangle from extensions of powers of eleven
Heliyon, 2022 Sir Isaac Newton noticed that the values of the first five rows of Pascal's triangle are each formed by a power of 11, and claimed that subsequent rows can also be generated by a power of 11.
Md. Shariful Islam +3 more
doaj +1 more source