English
Related papers

Related papers: Equality of multiplicity free skew characters

200 papers

Two quantum finite automata are equivalent if for all input string $\omega$ over the input alphabet the two automata accept $\omega$ with equal probability. In [Theoret. Comput. Sci. 410 (2009) 3006-3017], it was shown that a $k_1$-letter…

Computational Complexity · Computer Science 2023-06-06 Tianrong Lin

Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric…

Representation Theory · Mathematics 2012-05-16 Matthew Fayers

Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…

Combinatorics · Mathematics 2023-06-05 Coen del Valle , Peter J. Dukes

By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…

Representation Theory · Mathematics 2007-05-23 Mark Wildon

We present examples and diagrams illustrating the proofs appearing in "Real second-order freeness and the asymptotic real second-order freeness of several real matrix models", to which this paper is meant to be an appendix. We show how…

Probability · Mathematics 2012-04-30 C. Emily I. Redelmeier

Given a lattice $\Lambda$ in a locally compact abelian group $G$ and a measurable subset $\Omega$ with finite and positive measure, then the set of characters associated to the dual lattice form a frame for $L^2(\Omega)$ if and only if the…

Functional Analysis · Mathematics 2016-12-14 Davide Barbieri , Eugenio Hernandez , Azita Mayeli

Continuous-variable systems in quantum theory can be fully described through any one of the ${\rm s}$-ordered family of quasiprobabilities $\Lambda_{\rm s}(\alpha)$, ${\rm s} \in [-1,1]$. We ask for what values of $({\rm s}, a)$ is the…

Quantum Physics · Physics 2017-08-16 J. Solomon Ivan , Krishna Kumar Sabapathy , R. Simon

For any two partitions $\lambda$ and $\mu$ of a positive integer $N$, let $\chi_{\lambda}(\mu)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $\lambda$, evaluated at the conjugacy class of elements…

Number Theory · Mathematics 2026-04-01 Jayanta Barman , Kamalakshya Mahatab

We define a fat staircase to be a Ferrers diagram corresponding to a partition of the form $(n^{\alpha_n}, {n-1}^{\alpha_{n-1}},..., 1^{\alpha_1})$, where $\alpha = (\alpha_1,...,\alpha_n)$ is a composition, or the $180^\circ$ rotation of…

Combinatorics · Mathematics 2010-03-09 Matthew Morin

In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the…

Formal Languages and Automata Theory · Computer Science 2010-06-08 C. Robinson Tompkins

We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…

Combinatorics · Mathematics 2014-07-07 Grant Cairns , Stacey Mendan

In 2007, McNamara proved that two skew shapes can have the same Schur support only if they have the same number of $k\times \ell$ rectangles as subdiagrams. This implies that two ribbons can have the same Schur support only if one is…

Combinatorics · Mathematics 2018-10-23 Marisa Gaetz , Will Hardt , Shruthi Sridhar

We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…

Programming Languages · Computer Science 2013-05-28 Clemens Grabmayer , Jan Rochel

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

Combinatorics · Mathematics 2025-09-22 Senja Barthel , Fabio Buccoliero

We prove that for every natural number n there exists a natural number N(n) such that every multilinear skew-symmetric polynomial on N(n) or more variables which vanishes in the free associative algebra vanishes as well in any n-generated…

Rings and Algebras · Mathematics 2022-07-05 Ivan P. Shestakov

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g.\ extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of…

Logic in Computer Science · Computer Science 2023-04-27 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

We present several non-trivial examples of the three-dimensional quantum Nambu bracket which involve square matrices or three-index objects. Our examples satisfy two fundamental properties of the classical Nambu bracket: they are…

High Energy Physics - Theory · Physics 2010-02-03 Hidetoshi Awata , Miao Li , Djordje Minic , Tamiaki Yoneya

For integers $a_1, \dots, a_n \ge 0$ and $k \ge 1$, let $\mathcal L_{k+2}(a_1, \dots, a_n)$ denote the set of permutations of $\{1, \dots, a_1+\dots+a_n\}$ whose descent set is contained in $\{a_1, a_1+a_2, \dots, a_1+\dots+a_{n-1}\}$, and…

Combinatorics · Mathematics 2023-10-03 Evan Chen

In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cells filled with permutations. We consider many cases, where restricted to a permutation class, the staircase encoding…

Combinatorics · Mathematics 2023-06-22 Christian Bean , Émile Nadeau , Henning Ulfarsson

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

Logic · Mathematics 2009-09-25 Saharon Shelah