Related papers: SIP classes and four-parameter partition identitie…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
The present paper makes a study on Partition sort algorithm for negative binomial inputs. Comparing the results with those for binomial inputs in our previous work, we find that this algorithm is sensitive to parameters of both…
We prove a family of partition identities involving integer partitions in three colors. The conditions imposed on the types of partitions appearing in these identities involve constraints that arise in the Rogers-Ramanujan and…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
We announce a new four parameter partition theorem from which the (big) theorem of Gollnitz follows by setting any one of the parameters equal to 0. This settles a problem of Andrews who asked whether there exists a result that goes beyond…
We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In this paper, we propose a novel decomposition approach for mixed-integer stochastic programming (SMIP) problems that is inspired by the combination of penalty-based Lagrangian and block Gauss-Seidel methods (PBGS). In this sense, PBGS is…
Current deep learning classifiers, carry out supervised learning and store class discriminatory information in a set of shared network weights. These weights cannot be easily altered to incrementally learn additional classes, since the…
Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of…
Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…
How to quantify the distance between any two partitions of a finite set is an important issue in statistical classification, whenever different clustering results need to be compared. Developing from the traditional Hamming distance between…
In 2009, Berkovich and Garvan introduced a new partition statistic called the GBG-rank modulo $t$ which is a generalization of the well-known BG-rank. In this paper, we use the Littlewood decomposition of partitions to study partitions with…
We study structural aspects of randomized parameterized computation. We introduce a new class ${\sf W[P]}$-${\sf PFPT}$ as a natural parameterized analogue of ${\sf PP}$. Our definition uses the machine based characterization of the…
In 2011, Han and Ji proved addition-multiplication theorems for integer partitions, from which they derived modular analogues of many classical identities involving hook-length. In the present paper, we prove addition-multiplication…
This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…
It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…
Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…
In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…
The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…