Related papers: Partitions of an Integer into Powers
We present a simple numerical model for investigating the general properties of fragmentation. By use of molecular dynamics simulations, we study the impact fragmentation of a solid disk of interacting particles with a wall. Regardless of…
This work is devoted to the analysis of a Gibbs partition model, also known as a composition scheme. We consider a natural new condition on the component weights. It leads to a new behavior for the total number of components. We discover a…
We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…
We investigate the standard context, denoted by $\mathbb{K}\left(\mathcal{L}_{n}\right)$, of the lattice $\mathcal{L}_{n}$ of partitions of a positive integer $n$ under the dominance order. Motivated by the discrete dynamical model to study…
Fractional dynamics is a field of study in physics and mechanics investigating the behavior of objects and systems that are characterized by power-law non-locality, power-law long-term memory or fractal properties by using integrations and…
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly…
Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideals are inferred from the corresponding numbers of the…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…
We study fragmentation numerically using a simple model in which an object is taken to be a set of particles that interact pairwisely via a Lennard-Jones potential while the effect of the fragmentation-induced forces is represented by some…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
Partitioning a set of elements into an unknown number of mutually exclusive subsets is essential in many machine learning problems. However, assigning elements, such as samples in a dataset or neurons in a network layer, to an unknown and…
This paper presents a new technique for data slicing of distributed programs running on a hierarchy of machines. Data slicing can be realized as a program transformation that partitions heaps of machines in a hierarchy into independent…
A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…