Related papers: Reductions of Young tableau bijections

The individualization-refinement paradigm for computing a canonical labeling and the automorphism group of a graph is investigated. A new algorithmic design aimed at reducing the size of the associated search space is introduced, and a new…

We describe a formula for computing the product of the Young symmetrizer of a Young tableau with the Young symmetrizer of a subtableau, generalizing the classical quasi-idempotence of Young symmetrizers. We derive some consequences to the…

We study the structure and representations of a family of vertex algebras obtained from affine superalgebras by quantum reduction. As an application, we obtain in a unified way free field realizations and determinant formulas for all…

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

We present a new method of establishing a bijective correspondence - in fact, a lattice isomorphism - between action- and coaction-invariant ideals of C*-algebras and their crossed products by a fixed locally compact group. It is known that…

We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima,…

As the Internet grows in size, so does the amount of text based information that exists. For many application spaces it is paramount to isolate and identify texts that relate to a particular topic. While one-class classification would be…

We provide a summary of the mathematical and computational techniques that have enabled learning reductions to effectively address a wide class of problems, and show that this approach to solving machine learning problems can be broadly…

In this paper, we give bijections between the set of 4123-avoiding down-up alternating permutations of length $2n$ and the set of standard Young tableaux of shape $(n,n,n)$, and between the set of 4123-avoiding down-up alternating…

Coping with ambiguity has recently received a lot of attention in natural language processing. Most work focuses on the semantic representation of ambiguous expressions. In this paper we complement this work in two ways. First, we provide…

We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…

Given a real reductive group Lie group $G_\mathbb{R}$, the Mackey analogy is a bijection between the set of irreducible tempered representations of $G_\mathbb{R}$ and the set of irreducible unitary representations of its Cartan motion…

We compute the depth and regularity of ideals associated with arbitrary fillings of positive integers to a Young diagram, called the tableau ideals.

In these lectures we give an introduction to the reduction theory of binary forms starting with quadratic forms with real coefficients, Hermitian forms, and then define the Julia quadratic for any degree $n$ binary form. A survey of a…

Let $SYT_{n}$ be the set of all standard Young tableaux with $n$ cells and $\leq_{weak}$ be Melnikov's the weak order on $SYT_n$. The aim of this paper is to introduce a conjecture, called the {\it property of inner tableau translation} and…

We use a labelled deduction system based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between these…

This short course offers a new perspective on randomized algorithms for matrix computations. It explores the distinct ways in which probability can be used to design algorithms for numerical linear algebra. Each design template is…

We introduce Craig interpolation and related notions such as uniform interpolation, Beth definability, and theory decomposition in classical propositional logic. We present four approaches to computing interpolants: via quantifier…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

According to Jae Suk Park, physicists use "canonical coordinate systems" to compute correlations in perturbative quantum field theories. One may interpret these canonical coordinate systems as equivalences of generalized differential Lie…