Related papers: A New Partial Order on SYT
Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using of the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and…
We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.
Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.
Earlier papers \cite{VB2022,VB2023a,VB2023b} introduced the notions of a core and an index of a relation (an index being a special case of a core). A limited form of the axiom of choice was postulated -- specifically that all partial…
In this work we suggest the use of a set-theoretical interpretation of semantic tableaux for teaching propositional logic. If the student has previous notions of basic set theory, this approach to semantical tableaux can clarify her the way…
Given a collection $L$ of line segments, we consider its arrangement and study the problem of covering all cells with line segments of $L$. That is, we want to find a minimum-size set $L'$ of line segments such that every cell in the…
We give three algorithms to construct a semistandard tableau of given shape and weight, where the weight is a composition which is not necessarily a partition. With respect to a natural partial order on the set of semistandard tableaux, we…
We consider families $\mathcal{P}_n$ of plane lattice paths enumerated by Guy, Krattenthaler, and Sagan (1992). We show by explicit bijection that these families are equinumerous with the set $\mathrm{SYT}(n+2,2,1^n)$ of standard Young…
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
We give three interpretations of the number $b$ of orbits of the Borel subgroup of upper triangular matrices on the variety $\ms{X}$ of complete quadrics. First, we show that $b$ is equal to the number of standard Young tableaux on…
Young tableaux are classical combinatorial objects playing recurring and varied roles in representation theory, algebraic geometry and commutative algebra. This article is a short exposition on Young tableaux, written for the "WHAT IS...?"…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
This paper presents a novel SHOI tableau calculus which incorporates algebraic reasoning for deciding ontology consistency. Numerical restrictions imposed by nominals, existential and universal restrictions are encoded into a set of linear…
We make some general observations about partial orders on quotient spaces, and explore their use in music theory, in two different contexts. In the first, we show that many of the most familiar chord and scale types in Western music appear…
The finite Young lattice $L(m, n)$ is rank-symmetric, rank-unimodal, and has the strong Sperner property. R. Stanley further conjectured that $L(m, n)$ admits a symmetric chain order. We show that the order structure on $L(m, n)$ is…
In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s.…
This article introduces several new relations among related Hilbert space operators. In particular, we prove some L\"{o}ewner partial orderings among $T, |T|, \mathcal{R}T, \mathcal{I}T, |T|+|T^*|$ and many other related forms, as a new…
In this note, we explicitly compute the probability that a given cell in a random standard Young tableau of the shifted staircase shape $(2n-1, 2n-3, \ldots, 3,1)$ contains the maximal label. We also show that the asymptotic distribution of…