English
Related papers

Related papers: Matroids, hereditary collections and simplicial co…

200 papers

The finite-dimensional restricted simple Lie algebras of characteristic p > 5 are classical or of Cartan type. The classical algebras are analogues of the simple complex Lie algebras and have a well-advanced representation theory with…

Representation Theory · Mathematics 2015-09-23 Georgia Benkart , Jörg Feldvoss

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…

Combinatorics · Mathematics 2018-08-17 Benjamin Braun , Andrés R. Vindas-Meléndez

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

Rings and Algebras · Mathematics 2021-05-03 G. Grätzer , H. Lakser

A self-contained introduction to infinite dimensional representations over a tame hereditary algebra is provided, assuming a basic knowledge of the category of finite dimensional representations. This includes a complete description of all…

Representation Theory · Mathematics 2026-05-01 Lidia Angeleri Hügel , Andrew Hubery , Henning Krause

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

Combinatorics · Mathematics 2025-06-10 Emiliano Liwski , Fatemeh Mohammadi , Lisa Vandebrouck

Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…

Combinatorics · Mathematics 2019-11-28 Alexander Engström , Raman Sanyal , Christian Stump

The modular representation theory of finite groups has its origins in the work of Richard Brauer. In this survey article we first discuss the work being done on some outstanding conjectures in the theory. We then describe work done in the…

Representation Theory · Mathematics 2011-08-17 Bhama Srinivasan

A model of representations of a Lie algebra is a representation which a direct sum of all irreducible finite dimensional representations taken with multiplicity $1$. In the paper an explicit construction of a model of representation for all…

Representation Theory · Mathematics 2025-10-14 D. V. Artamonov

Under hypotheses required for the Taylor-Wiles method, we prove for forms of $U(3)$ which are compact at infinity that the lattice structure on upper alcove algebraic vectors or on principal series types given by the $\lambda$-isotypic part…

Number Theory · Mathematics 2017-10-13 Daniel Le

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

Combinatorics · Mathematics 2007-05-23 Bruce Sagan

Associated varieties are geometric objects appearing in infinite-dimensional representations of semisimple Lie algebras (groups). By applying Fourier transformations to the natural orthogonal oscillator representations of special linear Lie…

Representation Theory · Mathematics 2025-01-17 Hengjia Zhang , Xiaoping Xu

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…

Logic in Computer Science · Computer Science 2023-06-22 Davide Rinaldi , Daniel Wessel

It was conjectured at the end of the book "Representation theory of Artin algebras" by M. Auslander, I. Reiten and S. Smalo that an Artin algebra with the property that its finitely generated indecomposable modules are up to isomorphism…

Rings and Algebras · Mathematics 2025-04-28 Victor Blasco

Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. In recent years great progress has been made by augmenting `traditional' network theory.…

Data Analysis, Statistics and Probability · Physics 2016-06-03 Dominik Traxl , Niklas Boers , Jürgen Kurths

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

Combinatorics · Mathematics 2010-04-26 Jean Yves Semegni , Marcel Wild

Continuing with the authors concept (and results) of defining independence for columns of a boolean and superboolean matrix, we apply this theory to finite lattices and finite posets, introducing boolean and superboolean matrix…

Metric Geometry · Mathematics 2011-10-18 Zur Izhakian , John Rhodes

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

We consider the well-known Rosenbloom-Tsfasman function field lattices in the special case of Hermitian function fields. We show that in this case the resulting lattices are generated by their minimal vectors, provide an estimate on the…

Number Theory · Mathematics 2021-02-05 Albrecht Boettcher , Lenny Fukshansky , Stephan Ramon Garcia , Hiren Maharaj

We have determined composition series of a class of induced representations appearing in Moeglin Tadi\'c classification of discrete series. The result is further used to determine composition series of certain representations induced from…

Representation Theory · Mathematics 2021-05-12 Igor Ciganović

Theory of relations is the framework of this thesis. It is about enumeration of finite structures. Let $\mathscr C$ be a class of finite combinatorial structures, the \emph{profile} of $\mathscr C$ is the function $\varphi_{\mathscr C}$…

Combinatorics · Mathematics 2016-04-21 Djamila Oudrar