Related papers: Partitions and conservativity

For a permutation $\pi$, and the corresponding permutation matrix, we introduce the notion of {\em discrete derivative}, obtained by taking differences of successive entries in $\pi$. We characterize the possible derivatives of…

We characterize the Tukey order, the Galvin property/ Cohesive ultrafilters from \cite{Kanamori1978} in terms of ultrapowers. We use this characterization to measure the distance between the Tukey order and other well-known orders of…

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…

In the paper, the author studies properties of three functions relating to the exponential function and the existence of partitions of unity, including accurate and explicit computation of their derivatives, analyticity, complete…

In this paper, we give a combinatorial proof of a positivity result of Chern related to Andrews's $\mathcal{EO}^*$-type partitions. This combinatorial proof comes after reframing Chern's result in terms of copartitions. Using this new…

A relative one-relator presentation has the form P = < X,H ; R > where X is a set, H is a group, and R is a group word on X and H. We show that if the group word on X obtained from R by deleting all the terms from H has what we call the…

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

We introduce quasi-Prufer extensions of rings in order to relativize the notion of quasi-Prufer domains and to take into account some contexts recently introduced in the literature. We also introduce almost-Prufer ring extensions.…

We present a property satisfied by a large variety of complex continued fraction algorithms (the "finite building property") and use it to explore the structure of bijectivity domains for natural extensions of Gauss maps. Specifically, we…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

We consider high order approximations of the solution of the stochastic filtering problem, derive their pathwise representation in the spirit of the earlier work of Clark and Davis and prove their robustness property. In particular, we show…

State minimization of combinatorial filters is a fundamental problem that arises, for example, in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard. This paper conducts a more nuanced analysis of this…

We consider multiscale stochastic systems that are partially observed at discrete points of the slow time scale. We introduce a particle filter that takes advantage of the multiscale structure of the system to efficiently approximate the…

In this Brief Report, we propose a new index of user similarity, namely the transferring similarity, which involves all high-order similarities between users. Accordingly, we design a modified collaborative filtering algorithm, which…

We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow…

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…

We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods,…

Motivated by the success of Sinkhorn's algorithm for entropic optimal transport, we study convergence properties of iterative proportional fitting procedures (IPFP) used to solve more general information projection problems. We establish…