Related papers: Strictly chained (p,q)-ary partitions
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain first examples of so-called non-easy linear categories of…
We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…
An integer partition \lambda of n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition \lambda corresponds to an integrally closed ideal we call…
Schur's $Q$-functions with reduced variables are discussed by employing a combinatorics of strict partitions. They are called reduced $Q$-functions. We give a description of the linear relations among reduced $Q$-functions.
We find general solutions to the generating-function equation sum c_q^{(X)} z^q = F(z)^X, where X is a complex number and F(z) is a convergent power series with |F(0)| >0. We then use these results to derive finite expressions containing…
We present a natural extension of Andrews' multiple sums counting partitions with difference 2 at distance $k-1$, by deriving the generating function for $K$-restricted jagged partitions. A jagged partition is a collection of non-negative…
We consider procedures of sampling parts from a random integer partition. We determine asymptotically the probabilty distribution of the randomly-selected part whenever the positive integer that is partitioned becomes large.
In this article, we provide partition-theoretic interpretations for some new truncated pentagonal number theorem and identities of Gauss. Also, we deduce few inequalities for some partition functions.
Milliet asks the following question: given two prime numbers $p\neq q$, is there a division algebra of characteristic $p$ which is of dp-rank $q^2$ and of dimension $q^2$ over its center? We answer in the affirmative. We also give an…
A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…
The purpose of this paper is to study a class of ill-posed differential equations. In some settings, these differential equations exhibit uniqueness but not existence, while in others they exhibit existence but not uniqueness. An example of…
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
The projective degrees of strict partitions of n were computed for all n < 101 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n "lie close to each…
For prime powers q we use "strongly orthogonal" linear Sudoku solutions of order q^2 to construct ordered orthogonal arrays of type OOA (4,s,2,q), and for each q we present a range of values of s for which these constructions are valid.
In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…