Tootfinder

This tableau so exquisitely framed doth surpass the meanest stroke of the painter’s brush and standeth forth a piece most faultless, worthy of the highest commendation! 🎨🌹
#Movies #France #French

Promotion digraphs
Rebecca Patrias, Oliver Pechenik, Jessica Striker
https://arxiv.org/abs/2508.10969 https://arxiv.org/pdf/2508.10969

Promotion digraphs
Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under Schützenberger's promotion operator. Indeed, the promotion permutations uniquely determine the tableau $T$. We introduce more general promotion digraphs for both standard and increasing tableaux of arbitrary shape. For rectangular standard tableaux, this construction re…

Interpolation in Classical Propositional Logic
Patrick Koopmann, Christoph Wernhard, Frank Wolter
https://arxiv.org/abs/2508.11449 https://arxiv.org/pdf/25…

Interpolation in Classical Propositional Logic
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 elimination, from formulas in disjunctive normal form, and by extraction from resolution or tableau refutations. We close with a discussion of the size of interpolants and links to circuit complexity.

"Une étude publiée lundi bat en brèche l'idée d'une dominance des mâles largement répandue chez les primates. Cette recherche dresse un tableau bien plus nuancé des relations entre sexes opposés chez nos espèces cousines que sont les singes et lémuriens."
#science #éthologie

🇺🇦 Auf #radioeins läuft...
Keshavara:
🎵 Tableau Vivant (Radio Edit)
#NowPlaying #Keshavara
https://keshavara.bandcamp.com/track/tableau-vivant
https://open.spotify.com/track/1acyZGWB9gg9b5kMAWOf9L

Complexity of some modal logics of density (extended version)
Philippe Balbiani, Olivier Gasquet
https://arxiv.org/abs/2507.11238 https://

Complexity of some modal logics of density (extended version)
By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak density is in $PSPACE$.

On Lagrangian formulations for (ir)reducible mixed-antisymmetric higher integer spin fields in Minkowski spaces
Alexander A. Reshetnyak, Julia V. Bogdanova, Vipul K. Pandey
https://arxiv.org/abs/2509.09490

On Lagrangian formulations for (ir)reducible mixed-antisymmetric higher integer spin fields in Minkowski spaces
We extend the results of Lagrangian formulations study to construct gauge-invariant Lagrangians for (ir)reducible integer higher-spin massless and massive representations of the Poincare group with a Young tableau $Y[\hat{s}_1,\hat{s}_2,\hat{s}_3]$ in $d$-dimensional flat space-time (as the probable candidates to describe the Dark Matter problem beyond the SM). These particles are described within a metric-like formulation by tensor fields with 3 groups of antisymmetric Lorentz indices $Φ_{μ^…

Inversions Tableaux
Ilani Axelrod-Freed
https://arxiv.org/abs/2507.11516 https://arxiv.org/pdf/2507.11516

Inversions Tableaux
We introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley-symmetric that directly specialize to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced staircase tableaux of Edelman and Greene. We explicitly describe inversions tableaux that correspond to the lexicographically minimal and maximal monomials in each Schubert polynomial and characterize the unique inversions tableau for dominant permutations. We also def…

A Lazy Resynthesis Approach for Simultaneous T Gate and Two-Qubit Gate Optimization of Quantum Circuits
Mu-Te Lau (Ric), Hsiang-Chun Yang (Ric), Hsin-Yu Chen (Ric), Chung-Yang (Ric), Huang
https://arxiv.org/abs/2508.04092

A Lazy Resynthesis Approach for Simultaneous T Gate and Two-Qubit Gate Optimization of Quantum Circuits
State-of-the-art quantum circuit optimization (QCO) algorithms for T-count reduction often lead to a substantial increase in two-qubit gate count (2Q-count) -- a drawback that existing 2Q-count optimization techniques struggle to address effectively. In this work, we propose a novel lazy resynthesis approach for modern tableau-based QCO flows that significantly mitigates the 2Q-gate surges commonly introduced during T-count optimization in Clifford+T circuits. Experimental results show that our…

A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators
Beatrice Melani (Politecnico di Milano), Ezio Bartocci (TU Wien), Michele Chiari (TU Wien)
https://arxiv.org/abs/2507.21598

A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators
Signal Temporal Logic (STL) is a widely recognized formal specification language to express rigorous temporal requirements on mixed analog signals produced by cyber-physical systems (CPS). A relevant problem in CPS design is how to efficiently and automatically check whether a set of STL requirements is logically consistent. This problem reduces to solving the STL satisfiability problem, which is decidable when we assume that our system operates in discrete time steps dictated by an embedded sy…

Evaluating an Immersive Analytics Application at an Enterprise Business Intelligence Customer Conference
Matthew Brehmer, Ginger Gloystein, Bailiang Zhou, Abby Gray, Sruthi Pillai, Ben Medina, Vidya Setlur
https://arxiv.org/abs/2508.15152

Evaluating an Immersive Analytics Application at an Enterprise Business Intelligence Customer Conference
We reflect on an evaluation of an immersive analytics application (Tableau for visionOS) conducted at a large enterprise business intelligence (BI) conference. Conducting a study in such a context offered an opportunistic setting to gather diverse feedback. However, this setting also highlighted the challenge of evaluating usability while also assessing potential utility, as feedback straddled between the novelty of the experience and the practicality of the application in participants' analyti…

Supersymmetric Schur polynomials have saturated Newton polytopes
Dang Tuan Hiep, Khai-Hoan Nguyen-Dang
https://arxiv.org/abs/2507.22528 https://arxiv.org/p…

Supersymmetric Schur polynomials have saturated Newton polytopes
We prove that every supersymmetric Schur polynomial has a saturated Newton polytope (SNP). Our approach begins with a tableau-theoretic description of the suport, which we encode as a polyhedron with a totally unimodular constraint matrix. The integrality of this polyhedron follows from the Hoffman-Kruskal criterion, thereby establishing the SNP property. To our knowledge, this is the first application of total unimodularity to the SNP problem.

PSPACE-completeness of Grammar logics of bounded density
Olivier Gasquet
https://arxiv.org/abs/2507.14956 https://arxiv.org/pdf/2507.…

PSPACE-completeness of Grammar logics of bounded density
We introduce the family of multi-modal logics of bounded density and with a tableau-like approach using finite \emph{windows} which were introduced in \cite{BalGasq25}, we prove that their satisfiability problem is PSPACE-complete. As a side effect, the monomodal logic of density is shown to be in para-PSPACE.

Richardson tableaux and components of Springer fibers equal to Richardson varieties
Steven N. Karp, Martha E. Precup
https://arxiv.org/abs/2506.20792 https…

Richardson tableaux and components of Springer fibers equal to Richardson varieties
Motivated by the study of Springer fibers and their totally nonnegative counterparts, we define a new subset of standard tableaux called Richardson tableaux. We characterize Richardson tableaux combinatorially using evacuation as well as in terms of a pair of associated reading words. We also characterize Richardson tableaux geometrically, proving that a tableau is Richardson if and only if the corresponding component of a Springer fiber is a Richardson variety, which in turn holds if and only …

🇺🇦 #NowPlaying on BBCRadio3's #BBCProms
Maurice Ravel, Orchestre national de France & Cristian Măcelaru:
🎵 Daphnis et Chloe, M. 57, Tableau III: Danse generale (Bacchanale)
#MauriceRavel #OrchestrenationaldeFrance #CristianMăcelaru

On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals
Dipnit Biswas, Irfan Habib
https://arxiv.org/abs/2508.19796 https://

On the Polytope Model and Near End node Isomorphisms of Type $A$ Kirillov--Reshetikhin Crystals
We prove an inductive formula to construct a path from the highest weight element to any given vertex in the crystal graph of the polytope realization of the Kirillo-Reshetikhin crystal $KR^{i,m}$ of type $A$. For $i \le 2$ or $i \geq n-1$, we provide explicit formulas of the same by only using the lowering crystal operators and in those cases, using these paths, we determine the explicit image of any polytope under the affine crystal isomorphisms between the polytope and the tableau realizatio…

From dual canonical bases to positroidal subdivisions
Jian-Rong Li, Ayush Kumar Tewari
https://arxiv.org/abs/2506.19443 https://arxiv…

From dual canonical bases to positroidal subdivisions
The Grassmannian cluster algebra $\mathbb{C}[\text{Gr}(k, n)]$ admits a distinguished basis known as the dual canonical basis, whose elements correspond to rectangular semi-standard Young tableaux with $k$ rows and with entries in $[n]$. We establish that each such tableau induces a positroidal subdivision of the hypersimplex $Δ(k,n)$ via a map introduced by Speyer and Williams. For $\text{Gr}(2,n)$, we prove that non-frozen prime tableaux correspond precisely to the coarsest positroidal subdi…

Webification of symmetry classes of plane partitions
Ashleigh Adams, Jessica Striker
https://arxiv.org/abs/2508.16565 https://arxiv.org/pdf/2508.16565

Webification of symmetry classes of plane partitions
Webs are graphical objects that give a tangible, combinatorial way to compute and classify tensor invariants. Recently, [Gaetz, Pechenik, Pfannerer, Striker, Swanson 2023+] found a rotation-invariant web basis for $\mathrm{SL}_4$, as well as its quantum deformation $U_q(\mathfrak{sl}_4)$, and a bijection between move equivalence classes of $U_q(\mathfrak{sl}_4)$-webs and fluctuating tableaux such that web rotation corresponds to tableau promotion. They also found a bijection between the set of …