English
Related papers

Related papers: Knuth relations, tableaux and MV-cycles

200 papers

We study a class of varieties which generalize the classical orbital varieties of Joseph. We show that our generalized orbital varieties are the irreducible components of a Mirkovic-Vybornov slice to a nilpotent orbit, and can be labeled by…

Representation Theory · Mathematics 2021-06-01 Anne Dranowski

We prove that if $G$ and $H$ are $\alpha$-back-and-forth equivalent groups (in the sense of computable structure theory) for some ordinal $\alpha \geq \omega$, then their group von Neumann algebras $L(G)$ and $L(H)$ are also…

Logic · Mathematics 2024-03-26 Isaac Goldbring , Matthew Harrison-Trainor

In this paper we show that for any affine complete rational surface singularity there is a correspondence between the dual graph of the minimal resolution and the quiver of the endomorphism ring of the special CM modules. We thus call such…

Algebraic Geometry · Mathematics 2010-07-08 M. Wemyss

In a graph G; a vertex (resp. an edge) metric generator is a set of vertices S such that any pair of vertices (resp. edges) from G is distinguished by at least one vertex from S: The cardinality of a smallest vertex (resp. edge) metric…

Combinatorics · Mathematics 2021-07-06 Jelena Sedlar , Riste Škrekovski

Equational theories that contain axioms expressing associativity and commutativity (AC) of certain operators are ubiquitous. Theorem proving methods in such theories rely on well-founded orders that are compatible with the AC axioms. In…

Logic in Computer Science · Computer Science 2020-02-19 Akihisa Yamada , Sarah Winkler , Nao Hirokawa , Aart Middeldorp

We define an analog of David Little's algorithm for reduced words in type B, and investigate its main properties. In particular, we show that our algorithm preserves the recording tableau of Kra\'{s}kiewicz insertion, and that it provides a…

Combinatorics · Mathematics 2014-10-22 Sara Billey , Zachary Hamaker , Austin Roberts , Benjamin Young

We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…

Combinatorics · Mathematics 2007-05-23 Igor Pak , Ernesto Vallejo

Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable…

Combinatorics · Mathematics 2021-01-15 Marisa Gaetz , Caleb Ji

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

Rings and Algebras · Mathematics 2026-03-03 Lia Vas

For a split reductive group $G$ we realise identities in the Grothendieck group of $\widehat{G}$-representation in terms of cycle relations between certain closed subschemes inside the affine grassmannian. These closed subschemes are…

Number Theory · Mathematics 2025-05-05 Robin Bartlett

Fargues and Scholze proved the geometric Satake equivalence over the Fargues--Fontaine curve. On the other hand, Zhu proved the geometric Satake equivalence using a Witt vector affine Grassmannian. In this paper, we explain the relation…

Number Theory · Mathematics 2026-03-16 Katsuyuki Bando

Racks and quandles are algebraic structures with a single binary operation that is right self-distributive and right invertible, and additionally idempotent in the case of quandles. The invertibility condition is equivalent to the existence…

Rings and Algebras · Mathematics 2024-07-23 Wayne Burrows , Christopher Tuffley

We give a construction of MV-polytopes of a complex semisimple algebraic group G in terms of the geometry of the Bott-Samelson variety and the affine building. This is done by using the construction of dense subsets of MV-cycles by Gaussent…

Representation Theory · Mathematics 2019-12-19 Michael Ehrig

An equiangular tight frame (ETF) is a set of unit vectors whose coherence achieves the Welch bound, and so is as incoherent as possible. They arise in numerous applications. It is well known that real ETFs are equivalent to a certain…

Functional Analysis · Mathematics 2016-01-20 Matthew Fickus , Cody E. Watson

We introduce a characterization for affine equivalence of two surfaces of translation defined by either rational or meromorphic generators. In turn, this induces a similar characterization for minimal surfaces. In the rational case, our…

Algebraic Geometry · Mathematics 2021-12-20 Juan Gerardo Alcázar , Georg Muntingh

We construct invariants of relative K-theory classes of multiparameter dependent pseudodifferential operators, which recover and generalize Melrose's divisor flow and its higher odd-dimensional versions of Lesch and Pflaum. These higher…

K-Theory and Homology · Mathematics 2009-11-23 Matthias Lesch , Henri Moscovici , Markus Pflaum

C. Bonnaf{\'e}, M. Geck, L. Iancu, and T. Lam have conjectured a description of one-sided cells in unequal parameter Hecke algebras of type $B$ which is based on domino tableaux of arbitrary rank. In the integer case, this generalizes the…

Representation Theory · Mathematics 2008-03-25 Thomas Pietraho

We show that a reflective/coreflective pair of full subcategories satisfies a "maximal-normal"-type equivalence if and only if it is an associated pair in the sense of Kelly and Lawvere.

Operator Algebras · Mathematics 2011-12-21 Erik Bédos , S. Kaliszewski , John Quigg

In this work, we compute the first and second Zagreb indices for the commuting conjugacy class graphs associated with finite groups. We identify multiple classes of finite groups whose commuting conjugacy class graphs are shown to satisfy…

Group Theory · Mathematics 2025-06-03 Shrabani Das , Rajat Kanti Nath , Yilun Shang

Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the…

Combinatorics · Mathematics 2013-07-23 Alireza Abdollahi , Shahrooz Janbaz , Mohammad Reza Oboudi
‹ Prev 1 4 5 6 7 8 10 Next ›