Results 31 to 40 of about 66,960 (267)
European Journal of Combinatorics, 2005 The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the algebra depend polynomially on a parameter.
Tom Halverson, Arun Ram
openaire +3 more sources
Multiplicative Partitions [PDF]
The Electronic Journal of Combinatorics, 2013 New formulas for the multiplicative partition function are developed. Besides giving a fast algorithm for generating these partitions, new identities for additive partitions and the Riemann zeta function are also produced.
Marc Chamberland +3 more
openaire +2 more sources
Top Coefficients of the Denumerant [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 For a given sequence $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\alpha)(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2 x_2+
Velleda Baldoni +5 more
doaj +1 more source
Partition Statistics for Cubic Partition Pairs [PDF]
The Electronic Journal of Combinatorics, 2011 In this brief note, we give two partition statistics which explain the following partition congruences: \begin{align*} b(5n+4) &\equiv 0 \pmod{5}, \\ b(7n+a) &\equiv 0 \pmod{7}, \text{if $a=2$, $3$, $4$, or $6$}. \end{align*} Here, $b(n)$ is the number of $4$-color partitions of $n$ with colors $r$, $y$, $o$, and $b$ subject to the ...
openaire +2 more sources
A q-Series Congruence Inspired by Andrews and Ramanujan
Axioms, 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 Macrostates in Complex Multi-Scale Systems
Entropy, 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
Formal Aspects of Computing, 1993 Abstract By definition, a partition of a list is a division of that list into nonempty contiguous segments. Many programming and operations research problems can be specified in terms of list partitions, and we present a hierarchy of theorems for deriving programs from such specifications.
Bird, R, de Moor, O
openaire +1 more source
Arc Spaces and Rogers-Ramanujan Identities [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Arc spaces have been introduced in algebraic geometry as a tool to study singularities but they show strong connections with combinatorics as well. Exploiting these relations we obtain a new approach to the classical Rogers-Ramanujan Identities.
Clemens Bruschek +2 more
doaj +1 more source
Partitive Determiners, Partitive Pronouns and Partitive Case
, 2021 The fine-grained morpho-syntactic and semantic variation displayed by partitive elements across European languages is far from being well-described, let alone well-understood. This volume focuses on Partitive Determiners, Partitive Pronouns and Partitive Case in European languages, their emergence and spread in diachrony, their acquisition by L2 ...
Petra Sleeman, Giuliana Giusti
openaire +3 more sources