English
Related papers

Related papers: Minimal Bar Tableaux

200 papers

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

Combinatorics · Mathematics 2022-10-24 Avichai Marmor

Let $J_r$ denote an $r\times r$ matrix over a finite field $F$ with minimal and characteristic polynomials $(t-1)^r$. Suppose $r\leq s$. It is not hard to show that the Jordan canonical form of $J_r\otimes J_s$ is similar to…

Commutative Algebra · Mathematics 2016-07-21 S. P. Glasby , Cheryl E. Praeger , Binzhou Xia

Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…

Combinatorics · Mathematics 2007-05-23 Timothy Y. Chow , C. Kenneth Fan , Michel X. Goemans , Jan Vondrak

We use the 0-1 tableaux as a tool for enumerating permutations and partitions with restricted minima. The method used is extended for permutation pairs and partition pairs generated by a bipartite 0-1 tableaux.

Combinatorics · Mathematics 2014-08-13 Ken Joffaniel Gonzales

Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite…

Combinatorics · Mathematics 2022-04-13 M. Levent Doğan , Alperen A. Ergür , Jake D. Mundo , Elias Tsigaridas

When one expands a Schur function in terms of the irreducible characters of the symplectic (or orthogonal) group, the coefficient of the trivial character is 0 unless the indexing partition has an appropriate form. A number of q-analogues…

Representation Theory · Mathematics 2007-05-23 Eric M. Rains , Monica J. Vazirani

We find the minimum number $k=\mu'(\Sigma)$ for any surface $\Sigma$, such that every $\Sigma$-embeddable non-bipartite graph is not $k$-extendable. In particular, we construct the so-called bow-tie graphs $C_6\bowtie P_n$, and show that…

Combinatorics · Mathematics 2015-01-23 Hongliang Lu , David G. L. Wang

We obtain formulae for the minimum transformation degrees of the most well-studied families of finite diagram monoids, including the partition, Brauer, Temperley--Lieb and Motzkin monoids. For example, the partition monoid $P_n$ has degree…

Rings and Algebras · Mathematics 2026-02-17 Reinis Cirpons , James East , James D. Mitchell

Let M be an irreducible Riemannian symmetric space. The index of M is the minimal codimension of a (non-trivial) totally geodesic submanifold of M. We prove that the index is bounded from below by the rank of the symmetric space. We also…

Differential Geometry · Mathematics 2014-01-16 Jurgen Berndt , Carlos Olmos

Let $\Lambda$ be a finite dimensional algebra of type ${\mathbb A}_n$ over an algebraically closed field $K$ with the quiver $Q$ and let $|\Det(\Lambda)|$ be the number of the minimal right determiners of all irreducible morphisms between…

Representation Theory · Mathematics 2017-03-16 Xiaoxing Wu , Zhaoyong Huang

We classify the irreducible projective representations of symmetric and alternating groups of minimal possible and second minimal possible dimensions, and get a lower bound for the third minimal dimension. On the way we obtain some new…

Representation Theory · Mathematics 2011-12-19 Alexander S. Kleshchev , Pham Huu Tiep

Let $M$ be a $n\times m$ $(0,1)$-matrix. We define the $s$-binary rank, $br_s(M)$, of $M$ to be the minimal integer $d$ such that there are $d$ monochromatic rectangles that cover all the $1$-entries in the matrix, and each $1$-entry is…

Data Structures and Algorithms · Computer Science 2023-01-12 Nader H. Bshouty

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

Combinatorics · Mathematics 2022-03-17 Florence Maas-Gariépy , Étienne Tétreault

A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…

Logic · Mathematics 2008-12-15 Chantal Berline , Giulio Manzonetto , Antonio Salibra

We give the criterion for the irreducibility, the Schur irreducibility and the indecomposability of the set of two $n\times n$ matrices $\Lambda_n$ and $A_n$ in terms of the subalgebra associated with the "support" of the matrix $A_n$,…

Representation Theory · Mathematics 2008-11-02 Alexandre Kosyak

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

Data Structures and Algorithms · Computer Science 2013-12-09 Shayan Oveis Gharan , Luca Trevisan

Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…

Representation Theory · Mathematics 2024-12-23 Lorna Gregory

Let $T$ be an expanding Markov map with a countable number of inverse branches and a repeller $\Lambda$ contained within the unit interval. Given $\alpha \in \R_+$ we consider the set of points $x \in \Lambda$ for which $T^n(x)$ hits a…

Dynamical Systems · Mathematics 2011-09-14 Henry WJ Reeve

The number of standard Young tableaux possible of shape corresponding to a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were…

Combinatorics · Mathematics 2025-11-18 Aditya Khanna