English
Related papers

Related papers: Wonderful models for generalized Dowling arrangeme…

200 papers

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

Let $G$ be a graph with vertex set $V$ and of order $n = |V|$, and let $\delta(G)$ and $\Delta(G)$ be the minimum and maximum degree of $G$, respectively. Two disjoint sets $V_1, V_2 \subseteq V$ form a coalition in $G$ if none of them is a…

Discrete Mathematics · Computer Science 2022-11-03 Davood Bakhshesh , Michael A. Henning , Dinabandhu Pradhan

F-boxes defined in [6] as hyper-boxes in N^{\infty} discrete space were applied here for the geometric description of the cobweb posetes Hasse diagrams tilings. The F-boxes edges sizes are taken to be values of terms of natural numbers'…

Combinatorics · Mathematics 2009-04-02 M. Dziemianczuk

The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…

Rings and Algebras · Mathematics 2014-02-03 Primož Škraba , João Pita Costa

Relaxing first-class constraint conditions in the usual Drinfeld-Sokolov Hamiltonian reduction leads, after symmetry fixing, to realizations of W algebras expressed in terms of all the J-current components. General results are given for G a…

High Energy Physics - Theory · Physics 2009-10-28 F. Barbarin , E. Ragoucy , P. Sorba

Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…

Rings and Algebras · Mathematics 2021-06-03 Luciano J. González , Ismael Calomino

Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The…

Combinatorics · Mathematics 2013-10-01 Gyula O. H. Katona , Dániel T. Nagy

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

Combinatorics · Mathematics 2022-03-29 Ivan Martino , Rahul Singh

The general position number ${\rm gp}(G)$ of a graph $G$ is the cardinality of a largest set of vertices $S$ such that no element of $S$ lies on a geodesic between two other elements of $S$. The complementary prism $G\overline{G}$ of $G$ is…

Combinatorics · Mathematics 2020-01-08 Neethu P. K. , Ullas Chandran S. V. , Manoj Changat , Sandi Klavžar

When 1 -> H -> G -> Q -> 1 is a short exact sequence of three infinite, word-hyperbolic groups, Mahan Mitra (Mj) has shown that the inclusion map from H to G extends continuously to a map between the Gromov boundaries of H and G. This…

Group Theory · Mathematics 2020-12-16 Elizabeth Field

Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound…

Computational Geometry · Computer Science 2019-02-26 Ahmad Biniaz , Alfredo García

The open neighbourhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $D\subseteq V(G)$, we define $\overline{D}=V(G)\setminus D$. A set $D\subseteq V(G)$ is called a super dominating…

Combinatorics · Mathematics 2018-04-24 Douglas J. Klein , Juan A. Rodríguez-Velázquez , Eunjeong Yi

Exceptional sequences are certain ordered sequences of quiver representations. We introduce a class of objects called strand diagrams and use this model to classify exceptional sequences of representations of a quiver whose underlying graph…

Representation Theory · Mathematics 2016-11-15 Alexander Garver , Kiyoshi Igusa , Jacob P. Matherne , Jonah Ostroff

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

In this note, we discuss Hassett maximal cubic fourfolds and construct an explicit irreducible component of maximal dimension sixteen of the locus $\mathcal{Z}$ of Hassett maximal cubic fourfolds. We utilize algebraic and arithmetic methods…

Algebraic Geometry · Mathematics 2026-05-12 Elad Gal , Howard Nuer

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

Combinatorics · Mathematics 2007-05-23 Graham R. Brightwell , Peter Winkler

Metrics of interest in topological data analysis (TDA) are often explicitly or implicitly in the form of an interleaving distance $d_{\mathrm{I}}$ between poset maps (i.e. order-preserving maps), e.g. the Gromov-Hausdorff distance between…

Algebraic Topology · Mathematics 2022-07-21 Woojin Kim , Facundo Mémoli , Anastasios Stefanou

Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…

Representation Theory · Mathematics 2020-05-12 Alexander Heaton , Songpon Sriwongsa , Jeb F. Willenbring

Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…

Representation Theory · Mathematics 2024-12-02 Riju Bindua , Thomas Brüstle , Luis Scoccola

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 8 9 10 Next ›