Results 31 to 40 of about 302,421 (316)

Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
We revisit a classic partition theorem due to MacMahon that relates partitions with all parts repeated at least once and partitions with parts congruent to $2,3,4,6 \pmod{6}$, together with a generalization by Andrews and two others by Subbarao.
Shishuo Fu, James Sellers
doaj   +1 more source

Probabilistic Partitive Partitioning (PPP)

open access: yesCoRR, 2020
Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies can be achieved by reducing the input space if a minimal loss of information can be achieved.
openaire   +2 more sources

Partition algebras

open access: yesEuropean 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]

open access: yesThe 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

Partition Recurrences

open access: yesIntegers, 2018
15 ...
Yuriy Choliy   +2 more
openaire   +4 more sources

Generating trees for partitions and permutations with no k-nestings [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and restricted lattice ...
Sophie Burrill   +3 more
doaj   +1 more source

Subverting the Nation-State Through Post-Partition Nostalgia: Joginder Paul’s Sleepwalkers

open access: yesHumanities, 2019
With the advent of the Progressive Writers Movement, Urdu Literature was marked with a heightened form of social realism during the Partition of British India in 1947.
Amrita Ghosh
doaj   +1 more source

Reconstruction of Partitions [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2005
For the partition $x=[x_1\ge x_2\ge \cdots\ge x_k]$ of the integer $n=\sum_{i}\, x_{i}$ a $t$-deletion is a partition $y=[y_1\ge y_2\ge \cdots\ge y_k]$ with $x_{i}\geq y_{i}\geq 0$ and $\sum_{i}\, (x_{i}-y_{i})=t$. We prove that all partitions of $n$ are reconstructible from their $t$–deletions if $n$ is sufficiently large in relation to $t$.
Pretzel, Oliver, Siemons, Johannes
openaire   +3 more sources

Tsallis Entropy of Product MV-Algebra Dynamical Systems

open access: yesEntropy, 2018
This paper is concerned with the mathematical modelling of Tsallis entropy in product MV-algebra dynamical systems. We define the Tsallis entropy of order α , where α ∈ ( 0 , 1 ) ∪ ( 1 , ∞ ) , of a partition in ...
Dagmar Markechová, Beloslav Riečan
doaj   +1 more source

Planetary Gears Feature Extraction and Fault Diagnosis Method Based on VMD and CNN

open access: yesSensors, 2018
Given local weak feature information, a novel feature extraction and fault diagnosis method for planetary gears based on variational mode decomposition (VMD), singular value decomposition (SVD), and convolutional neural network (CNN) is proposed. VMD was
Chang Liu   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy