English
Related papers

Related papers: A matrix approach to the structure, enumeration, a…

200 papers

We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than $c$…

Commutative Algebra · Mathematics 2020-06-17 Alessio D'Alì , Gunnar Fløystad , Amin Nematbakhsh

A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a…

Combinatorics · Mathematics 2017-05-17 Hiroshi Hirai , So Nakashima

We consider categories of posets with $\mathfrak{C}$-valued structure sheaves for any category $\mathfrak{C}$ and see how they possess poset-indexed lax colimits that are both easy to describe and "weakly equivalent" to their ordinary…

Algebraic Geometry · Mathematics 2023-01-10 J. Sánchez González

Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…

Combinatorics · Mathematics 2008-12-15 Andrey O. Matveev

Specht polynomials classically realize the irreducible representations of the symmetric group. The ideals defined by these polynomials provide a strong connection with the combinatorics of Young tableaux and have been intensively studied by…

Combinatorics · Mathematics 2023-05-30 Sebastian Debus , Philippe Moustrou , Cordian Riener , Hugues Verdure

In this thesis we enumerate standard young tableaux (SYT) of certain truncated skew shapes, which we call battery shapes. This is motivated by a chess problem. In an enumerative chess problem, the set of moves in the solution is (usually)…

Combinatorics · Mathematics 2022-06-27 Amir Shoan

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

Optimization and Control · Mathematics 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…

Combinatorics · Mathematics 2014-08-25 Jessica Striker

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…

Algebraic Topology · Mathematics 2026-04-09 Ulrich Bauer , Thomas Brüstle , Luis Scoccola

This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…

Functional Analysis · Mathematics 2022-03-16 Radu Balan , Naveed Haghani , Maneesh Singh

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

Motivated by the study of the recurrent orbits in a Morse set of a Morse decomposition, we introduce the concept of Morse predecomposition of an isolated invariant set in the setting of combinatorial and classical dynamical systems. We…

Dynamical Systems · Mathematics 2024-11-28 Michał Lipiński , Konstantin Mischaikow , Marian Mrozek

Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We put ASMs into a larger context by studying the order ideals of subposets of a…

Combinatorics · Mathematics 2019-05-22 Jessica Striker

The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…

Algebraic Topology · Mathematics 2020-04-23 Manuel Norman

In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…

Commutative Algebra · Mathematics 2009-09-22 Ural Bekbaev

Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…

Classical Analysis and ODEs · Mathematics 2024-03-19 Lidia Aceto , Helmuth Robert Malonek , Graça Tomaz

We define a new class of countable groups, which are defined by its action on the set of monotonic numberings (diagrams) of an arbitrary finite or countable partial ordered set (poset). These groups are generated by the set of involutions?…

Combinatorics · Mathematics 2021-11-17 Anatoly Vershik

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

Combinatorics · Mathematics 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Data Structures and Algorithms · Computer Science 2025-12-23 Robert Streit , Vijay K. Garg
‹ Prev 1 4 5 6 7 8 10 Next ›