English
Related papers

Related papers: Flip of lattices

200 papers

Quiver mutation plays a crucial role in the definition of cluster algebras by Fomin and Zelevinsky. It induces an equivalence relation on the set of all quivers without loops and two-cycles. A quiver is called mutation-acyclic if it is…

Representation Theory · Mathematics 2011-02-21 Matthias Warkentin

The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015).…

Combinatorics · Mathematics 2025-04-21 Clément Chenevière , Wenjie Fang , Corentin Henriet

In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…

Combinatorics · Mathematics 2021-10-22 Bazeniar Abdelghafour , Moussa Ahmia , José L. Ramírez , Diego Villamizar

We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…

Logic in Computer Science · Computer Science 2009-11-13 Luca Bernardinello , Lucia Pomello , Stefania Rombolà

We derive an algorithm for mutating quivers of 2-CY tilted algebras that have loops and 2-cycles, under certain specific conditions. Further, we give the classification of the 2-CY tilted algebras coming from standard algebraic 2-CY…

Representation Theory · Mathematics 2010-04-26 Marco Angel Bertani-Økland , Steffen Oppermann

We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…

Algebraic Geometry · Mathematics 2024-07-19 Matthew Dawes

In 1986, Oliver Pretzel studied the set of orientations of a connected finite graph $G$ and showed that any two such orientations having the same flow-difference around all closed loops can be obtained from one another by a succession of…

Combinatorics · Mathematics 2025-10-15 James Propp

This paper has two objectives. First, we study lattices with skew-Hermitian forms over division algebras with positive involutions. For division algebras of Albert types I and II, we show that such a lattice contains an "orthogonal" basis…

Number Theory · Mathematics 2023-07-20 Christopher Daw , Martin Orr

We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…

Combinatorics · Mathematics 2020-12-21 Allan P. Fordy , Bethany Marsh

We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…

Logic · Mathematics 2021-09-14 Wesley Fussner , Gavin St. John

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…

Category Theory · Mathematics 2026-03-02 Ismael Gutierrez Garcia , Luz Adriana Mejía Castaño

Irreducible modules of the 3-permutation orbifold of a rank one lattice vertex operator algebra are listed explicitly. Fusion rules are determined by using the quantum dimensions. The $S$-matrix is also given.

Quantum Algebra · Mathematics 2017-06-27 Chonging Dong , Feng Xu , Nina Yu

There are well-known constructions relating ring epimorphisms and tilting modules. The new notion of silting module provides a wider framework for studying this interplay. To every partial silting module we associate a ring epimorphism…

Representation Theory · Mathematics 2015-04-28 Lidia Angeleri Hügel , Frederik Marks , Jorge Vitória

The notion of mutation plays crucial roles in representation theory of algebras. Two kinds of mutation are well-known: tilting/silting mutation and quiver-mutation. In this paper, we focus on tilting mutation for symmetric algebras.…

Representation Theory · Mathematics 2014-06-26 Takuma Aihara

For Brauer graph algebras, tilting mutation is compatible with flip of Brauer graphs. The aim of this paper is to generalize this result to the class of Brauer configuration algebras introduced by Green and Schroll recently. More precisely,…

Representation Theory · Mathematics 2024-03-22 Toshitaka Aoki , Yingying Zhang

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

Logic · Mathematics 2023-07-25 Sergey V. Sudoplatov

This work concerns representations of a finite flat group scheme $G$, defined over a noetherian commutative ring $R$. The focus is on lattices, namely, finitely generated $G$-modules that are projective as $R$-modules, and on the full…

Representation Theory · Mathematics 2024-09-27 Tobias Barthel , Dave Benson , Srikanth B. Iyengar , Henning Krause , Julia Pevtsova

This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…

Logic · Mathematics 2026-04-21 Juanda Kelana Putra , Richard Smolka

A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…

K-Theory and Homology · Mathematics 2009-11-02 Tomasz Maszczyk

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

Discrete Mathematics · Computer Science 2021-09-30 Pranab Basu
‹ Prev 1 3 4 5 6 7 10 Next ›