Related papers: A Partial Order on Bipartitions From the Generaliz…
Schmidt decomposition is a powerful tool in quantum information. While Schmidt decomposition is universal for bipartite states, its not for multipartite states. In this article, we review properties of bipartite Schmidt decompositions and…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…
We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…
In this extended abstract we announce a proof that, in a Coxeter group of rank 3, low elements are in bijection with small inversion sets. This gives a partial confirmation of Conjecture 2 in [Dyer, Hohlweg '16]. That same article provides…
Set partitions avoiding $k$-crossing and $k$-nesting have been extensively studied from the aspects of both combinatorics and mathematical biology. By using the generating tree technique, the obstinate kernel method and Zeilberger's…
Let $G$ be a finite group acting vertex-transitively on a graph. We show that bounding the order of a vertex stabilizer is equivalent to bounding the second singular value of a particular bipartite graph. This yields an alternative…
Taking symmetric powers of varieties can be seen as a functor from the category of varieties to the category of varieties with an action by the symmetric group. We study a corresponding map between the Grothendieck groups of these…
Work of Linnell shows that the space of left-orderings of a group is either finite or uncountable, and in the case that the space is finite, the isomorphism type of the group is known---it is what is known as a Tararin group. By defining…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…
We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…
Consider a group $G$ of order $M$ acting unitarily on a real inner product space $V$. We show that the sorting based embedding obtained by applying a general linear map $\alpha : \mathbb{R}^{M \times N} \to \mathbb{R}^D$ to the invariant…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…
We show that if a nontrivial group admits a locally invariant ordering, then it admits uncountably many locally invariant orderings. For the case of a left-orderable group, we provide an explicit construction of uncountable families of…
Various partial orders related to the structures of dual canonical monoids are investigated. It is shown that the nilpotent variety of a dual canonical monoid is equidimensional; its dimension is found. It is shown in type A that certain…
In this article we study left I-orders in the bicyclic monoid $\mathcal{B}$. We give necessary and sufficient conditions for a subsemigroup of $\mathcal{B}$ to be a left I-oreder in $\mathcal{B}$. We then prove that any left I-order in…