Results 41 to 50 of about 660,683 (355)
Probabilistic Partitive Partitioning (PPP)
CoRR, 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
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
New results and conjectures on 2-partitions of multisets [PDF]
, 2017 The interplay between integer sequences and partitions has led to numerous interesting results, with implications in generating functions, integral formulae, or combinatorics.
Andrica, D. +5 more
core +1 more source
Plane partitions in the work of Richard Stanley and his school [PDF]
, 2015 These notes provide a survey of the theory of plane partitions, seen through the glasses of the work of Richard Stanley and his school.
C. Krattenthaler
semanticscholar +1 more source
An extension of MacMahon's equidistribution theorem to ordered set partitions [PDF]
Journal of Combinatorial Theory, 2014 We prove a conjecture of Haglund which can be seen as an extension of the equidistribution of the inversion number and the major index over permutations to ordered set partitions.
J. Remmel, A. Wilson
semanticscholar +1 more source
Reconstruction of Partitions [PDF]
The 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
Methodology for automatic recovering of 3D partitions from unstitched faces of non-manifold CAD models [PDF]
, 2013 Data exchanges between different software are currently used in industry to speed up the preparation of digital prototypes for Finite Element Analysis (FEA).
PERNOT, Jean-Philippe +1 more
core +1 more source
Bayesian nonparametric estimators derived from conditional Gibbs structures [PDF]
, 2008 We consider discrete nonparametric priors which induce Gibbs-type exchangeable random partitions and investigate their posterior behavior in detail.
PRUENSTER, IGOR +5 more
core +1 more source