相关论文: Simultaneous core multipartitions

Simultaneous broadcasting of multiple messages from the same source vertex in synchronous networks is considered under restrictions that each vertex receives at most one message in a unit time step, every received message can be sent out…

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…

A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…

In this paper, we extend the work of Abbondati et al. (2024) on decoding simultaneous rational function codes by addressing two important scenarios: multiplicities and poles (zeros of denominators). First, we generalize previous results to…

There are various approaches to graph learning for data clustering, incorporating different spectral and structural constraints through diverse graph structures. Some methods rely on bipartite graph models, where nodes are divided into two…

A set of sequences is said to converge simultaneously if there exists an infinite subset $H$ of the index set $\omega$ such that all sequences converge when restricted to $H$. We discuss simultaneous convergence of sequences in the same or…

The statistics of local measurements of joint quantum systems can sometimes be used to distinguish the spatiotemporal structure in which they were measured. We first prove that every bipartite separable density matrix is temporally…

A new method to study the long-range correlations in multiparticle production is developped. It is proposed to study the joint factorial moments or cumulants of multiplicity distributions in several (more than two) bins. It is shown that…

Let $R$ be a commutative ring with identity and $S$ a multiplicative subset of $R$. In this paper, we first introduce and study the notions of $s$-pure exact sequences and $s$-absolutely pure modules which extend the classical notions of…

Let $R$ be a commutative ring and $M_n(R)$ be the ring of $n \times n$ matrices with entries from $R$. For each $S \subseteq M_n(R)$, we consider its (generalized) null ideal $N(S)$, which is the set of all polynomials $f$ with coefficients…

We can generalize the definition of {\it splitting number } $s(\kappa )$ for $\kappa$ uncountable regular: $s(\kappa )=min\{ |\Cal S|:\Cal S\subset \Cal P(\kappa ) \forall a\in \kappa ^\kappa \exists b\in \Cal S |a\cap b|=|a\setminus…

We consider sequences counting integer partitions in two colors (red and blue) in which the even parts occur only in blue color. We focus on subsequences defined by constraints on the parity and color of the summands. We establish formulas…

Manycore SoC architectures based on on-chip shared memory are preferred for flexible and programmable solutions in many application domains. However, the development of many ported memory is becoming increasingly challenging as we approach…

The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware supports parallel processing, there is a need to revamp…

We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new…

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let the representation function $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. In…

In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…

Jaclyn Anderson proved that if s and t are relatively prime positive integers, then there are exactly (s+t-1)!/(s!t!) partitions whose set of hook-lengths is disjoint from the set {s,t}. Drew Armstrong conjectured (and Paul Johnson, and a…

Classification problems have been introduced by M. Ziegler as a generalization of promise problems. In this paper we are concerned with solvability and unsolvability questions with respect to a given set or language family, especially with…

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved