Related papers: Global structure of integer partitions sequences
Polymers, composed of repeating structural units called monomers, are fundamental materials in daily life and industry. Accurate property prediction for polymers is essential for their design, development, and application. However, existing…
Let A and M be nonempty sets of positive integers. A partition of the positive integer n with parts in A and multiplicities in M is a representation of n in the form n = \sum_{a\in A} m_a a, where m_a is in M U {0} for all a in A, and m_a…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
Motivated by the fundamental problem of measuring species diversity, this paper introduces the concept of a cluster structure to define an exchangeable cluster probability function that governs the joint distribution of a random count and…
The performance of sparse matrix computation highly depends on the matching of the matrix format with the underlying structure of the data being computed on. Different sparse matrix formats are suitable for different structures of data.…
All known terrestrial proteins are coded as continuous strings of ~20 amino acids. The patterns formed by the repetitions of elements in groups of finite sequences describes the natural architectures of protein families. We present a method…
The four-parameter weight of partitions played an important role in the theory of integer partitions, for its connection with various statistics, including the alternating sum and the BG-rank. In 2022, Andrews introduced the SIP classes, by…
We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type…
Ewens-Pitman's partition structure arises as a system of sampling consistent probability distributions on set partitions induced by the Pitman-Yor process. It is widely used in statistical applications, particularly in species sampling…
We investigate the global structure of topological defects which wrap a submanifold $F\subset M$ in a quantum field theory defined on a closed manifold $M$. The Pontryagin-Thom construction oversees the interplay between the global…
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…
In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…
A perfect structure is a triple $(M,P,S)$ of matrices $M, P$ and $S$ of consistent sizes such that $MP = PS$. Perfect structures comprise similar matrices, eigenvectors, perfect colorings (equitable partitions) and graph coverings. In this…
In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability $p$ and $q$, respectively…
For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…
Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…
The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…
This article determines the structure of the group ring $\mathbb{Z}_nG$, where $G$ is a finite group and $\mathbb{Z}_n$ is the ring of integers modulo $n$, such that $n$ is relatively prime to the order of $G$. The decomposition of…