English
Related papers

Related papers: Coxeter-Knuth graphs and a signed Little map for t…

200 papers

We formulate a twisted version of the conjectured duality between heterotic and type I string theories. Our formulation relates the chiral part of the heterotic string with a type I topological B-model on a Calabi-Yau five-fold. We provide…

High Energy Physics - Theory · Physics 2021-10-28 Kevin Costello , Brian R. Williams

We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…

Operator Algebras · Mathematics 2011-10-10 Alex Kumjian , David Pask , Aidan Sims

We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of…

Combinatorics · Mathematics 2025-02-12 Juliette Schabanel

We give a bijective proof of Macdonald's reduced word identity using pipe dreams and Little's bumping algorithm. This proof extends to a principal specialization due to Fomin and Stanley. Such a proof has been sought for over 20 years. Our…

Combinatorics · Mathematics 2017-02-10 Sara C. Billey , Alexander E. Holroyd , Benjamin Young

We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…

Machine Learning · Computer Science 2021-07-30 Thomas Konstantinovsky , Matan Mizrachi

We define crystal operators on semistandard shifted tableaux, giving a new proof that Schur $P$-functions are Schur positive. We define a queer crystal operator to construct a connected queer crystal on semistandard shifted tableaux of a…

Combinatorics · Mathematics 2018-02-22 Sami Assaf , Ezgi Kantarcı Oğuz

This paper introduces the category of marked curved Lie algebras with curved morphisms, equipping it with a closed model category structure. This model structure is---when working over an algebraically closed field of characteristic…

Algebraic Topology · Mathematics 2017-05-09 James Maunder

In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…

Rings and Algebras · Mathematics 2024-11-12 Ivan-Vanja Boroja , Hamid Reza Dorbidi , Damjana Kokol Bukovšek , Nik Stopar

The Burrows-Wheeler transform (BWT) is a well studied text transformation widely used in data compression and text indexing. The BWT of two strings can also provide similarity measures between them, based on the observation that the more…

Data Structures and Algorithms · Computer Science 2020-09-10 Felipe A. Louza , Guilherme P. Telles , Simon Gog , Liang Zhao

We describe the embedding from the crystal of Kashiwara-Nakashima tableaux in type $D$ of an arbitrary shape into that of $\mathbf{i}$-Lusztig data associated to a family of reduced expressions $\mathbf{i}$ which are compatible with the…

Quantum Algebra · Mathematics 2025-03-04 Il-Seung Jang , Jae-Hoon Kwon

A 0-Hecke algebra is a deformation of the group algebra of a Coxeter group. Based on work of Norton and Krob--Thibon, we introduce a tableau approach to the representation theory of 0-Hecke algebras of type A, which resembles the classic…

Representation Theory · Mathematics 2016-03-03 Jia Huang

A direct relation between the conformal formalism for 2d-quantum gravity and the W-constrained KP hierarchy is found, without the need to invoke intermediate matrix model technology. The Kontsevich-Miwa transform of the KP hierarchy is used…

High Energy Physics - Theory · Physics 2009-10-22 B. ~Gato-Rivera , A. ~M. ~Semikhatov

Graph transformation is the rule-based modification of graphs, and is a discipline dating back to the 1970s. In general, to match the left-hand graph of a fixed rule within a host graph requires polynomial time, but to improve matching…

Logic in Computer Science · Computer Science 2021-01-05 Graham Campbell , Detlef Plump

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…

Combinatorics · Mathematics 2009-05-18 Tobias Ahsendorf

A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…

Quantum Algebra · Mathematics 2007-05-23 Swapneel Mahajan

We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…

Combinatorics · Mathematics 2023-04-04 Sami H. Assaf

We obtain the equivariant K-homology of the classifying space \underline{E}W for W a right-angled or, more generally, an even Coxeter group. The key result is a formula for the relative Bredon homology of \underline{E}W in terms of Coxeter…

K-Theory and Homology · Mathematics 2009-08-07 Ruben Sanchez-Garcia

In this thesis, a detailed study shows that closed itemsets and minimal generators play a key role for concisely representing both frequent itemsets and association rules. These itemsets structure the search space into equivalence classes…

Databases · Computer Science 2019-11-05 Sadok Ben Yahia

Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…

Combinatorics · Mathematics 2016-09-05 Tilen Marc
‹ Prev 1 8 9 10 Next ›