English
Related papers

Related papers: Super Multiset RSK and a Mixed Multiset Partition …

200 papers

We investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for q-Schur superalgebras. This gives a combinatorialisation of the relative norm approach developed by the…

Quantum Algebra · Mathematics 2018-03-20 Jie Du , Haixia Gu , Zhongguo Zhou

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this…

Optimization and Control · Mathematics 2018-01-08 Xiaohui Wang , Longfei Wang , Yong Xia

We claim that both multipartiteness and localization of subsystems of compound quantum systems are of an essentially relative nature crucially depending on the set of operationalistically available states. In a more general setting, to…

Quantum Physics · Physics 2007-05-23 Ioannis Raptis , Roman Zapatrin

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…

Optimization and Control · Mathematics 2019-09-20 Santanu S. Dey , Burak Kocuk , Asteroide Santana

In the symmetric group $S_n$, each element $\sigma$ has an associated cycle type $\alpha$, a partition of $n$ that identifies the conjugacy class of $\sigma$. The Robinson-Schensted (RS) correspondence links each $\sigma$ to another…

Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…

Combinatorics · Mathematics 2010-11-03 Vassiliki Farmaki , Andreas Koutsogiannis

Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…

Programming Languages · Computer Science 2025-04-15 Nayan Rajesh

We give a definition of coisotropic morphisms of shifted Poisson (i.e. $P_n$) algebras which is a derived version of the classical notion of coisotropic submanifolds. Using this we prove that an intersection of coisotropic morphisms of…

Algebraic Geometry · Mathematics 2021-06-23 Pavel Safronov

Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…

Data Structures and Algorithms · Computer Science 2025-02-11 Nicolas Faroß , Sebastian Volz

The supermultiplet model, based on the reduction chain $\mathfrak{su}(4) \supset \mathfrak{su}(2) \times \mathfrak{su}(2)$, is revisited through the lens of commutants within universal enveloping algebras of Lie algebras. From this…

Mathematical Physics · Physics 2026-01-07 Rutwig Campoamor-Stursberg , Danilo Latini , Ian Marquette , Junze Zhang , Yao-Zhong Zhang

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

Combinatorics · Mathematics 2010-11-17 William J. Keith , Rishi Nath

We introduce a method for jointly registering ensembles of partitioned datasets in a way which is both geometrically coherent and partition-aware. Once such a registration has been defined, one can group partition blocks across datasets in…

Computational Geometry · Computer Science 2021-07-09 Tom Needham , Thomas Weighill

Alternative mathematical explorations in quantum computing can be of great scientific interest, especially if they come with penetrating physical insights. In this paper, we present a critical revisitation of our geometric (Clifford)…

Quantum Physics · Physics 2024-06-13 Carlo Cafaro , Newshaw Bahreyni , Leonardo Rossetti

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

Computational Complexity · Computer Science 2012-10-31 Matthias Christandl , Brent Doran , Michael Walter

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Quantum Physics · Physics 2007-05-23 D. Salgado , J. L. Sanchez-Gomez , M. Ferrero

Using equidistribution criteria, we establish divisibility by cyclotomic polynomials of several partition polynomials of interest, including $spt$-crank, overpartition pairs, and $t$-core partitions. As corollaries, we obtain new proofs of…

Number Theory · Mathematics 2023-10-24 Amanda Folsom , Joshua Males , Larry Rolen

We study M(n,k,r), the number of orbits of {(a_1,...,a_k)\in Z_n^k | a_1+...+a_k = r (mod n)} under the action of S_k. Equivalently, M(n,k,r) sums the partition numbers of an arithmetic sequence: M(n,k,r) = sum_{t \geq 0} p(n-1,k,r+nt),…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Alex J. Feingold , Michael D. Weiner

The multiplicity of a weight in a finite-dimensional irreducible representation of a simple Lie algebra g can be computed via Kostant's weight multiplicity formula. This formula consists of an alternating sum over the Weyl group (a finite…

Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and form the family of semidefinite-representable sets. This…

Algebraic Geometry · Mathematics 2026-05-13 Corentin Cornou , Simone Naldi , Tristan Vaccon