Results 31 to 40 of about 403,387 (285)

Epsilon-noncrossing partitions and cumulants in free probability

open access: yes, 2016
Motivated by recent work on mixtures of classical and free probabilities, we introduce and study the notion of $\epsilon$-noncrossing partitions. It is shown that the set of such partitions forms a lattice, which interpolates as a poset between the poset
Ebrahimi-Fard, Kurusch   +2 more
core   +1 more source

A q-Series Congruence Inspired by Andrews and Ramanujan

open access: yesAxioms, 2023
For each s∈{1,3,5}, we consider Rs(n) to be the number of the partitions of n into parts not congruent to 0, ±s(mod12). In recent years, some relations for computing the value of R3(n) were studied.
Mircea Merca
doaj   +1 more source

On the largest sizes of certain simultaneous core partitions with distinct parts

open access: yes, 2017
Motivated by Amdeberhan's conjecture on $(t,t+1)$-core partitions with distinct parts, various results on the numbers, the largest sizes and the average sizes of simultaneous core partitions with distinct parts were obtained by many mathematicians ...
Xiong, Huan
core   +2 more sources

Combinatorics of k-shapes and Genocchi numbers [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
In this paper we present a work in progress on a conjectural new combinatorial model for the Genocchi numbers. This new model called irreducible k-shapes has a strong algebraic background in the theory of symmetric functions and leads to seemingly new ...
Florent Hivert, Olivier Mallet
doaj   +1 more source

Random sampling of plane partitions

open access: yes, 2009
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly ...
Bodini, Olivier   +2 more
core   +2 more sources

On Macrostates in Complex Multi-Scale Systems

open access: yesEntropy, 2016
A characteristic feature of complex systems is their deep structure, meaning that the definition of their states and observables depends on the level, or the scale, at which the system is considered.
Harald Atmanspacher
doaj   +1 more source

Counting Shi regions with a fixed separating wall [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
Athanasiadis introduced separating walls for a region in the extended Shi arrangement and used them to generalize the Narayana numbers. In this paper, we fix a hyperplane in the extended Shi arrangement for type A and calculate the number of dominant ...
Susanna Fishel   +2 more
doaj   +1 more source

Coding partitions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2007
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition.
BURDERI, Fabio, RESTIVO, Antonio
openaire   +4 more sources

Geometry and complexity of O'Hara's algorithm [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we see that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result.
Matjaž Konvalinka, Igor Pak
doaj   +1 more source

Five-Dimensional Supersymmetric Yang-Mills Theories and Random Plane Partitions

open access: yes, 2005
Five-dimensional $\mathcal{N}=1$ supersymmetric Yang-Mills theories are investigated from the viewpoint of random plane partitions. It is shown that random plane partitions are factorizable as q-deformed random partitions so that they admit the ...
Maeda, Takashi   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy