中文
相关论文

相关论文: Poset Edge-Labellings and Left Modularity

200 篇论文

Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is…

组合数学 · 数学 2015-02-02 Lili Mu , Richard P. Stanley

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

组合数学 · 数学 2017-08-29 Jonathan A. Noel , Alex Scott , Benny Sudakov

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

组合数学 · 数学 2022-11-17 Sylvie Corteel , Sergi Elizalde , Carla Savage

We address the following natural but hitherto unstudied question: what are the possible linear extension numbers of an $n$-element poset? Let $\mathbf{LE}(n)$ denote the set of all positive integers that arise as the number of linear…

组合数学 · 数学 2019-06-17 Noah Kravitz , Ashwin Sah

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

数据结构与算法 · 计算机科学 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…

组合数学 · 数学 2022-11-14 Florent Foucaud , Tuomo Lehtilä

A lattice L is called opc if every monotone function f : L^n -> L is induced by a polynomial. We show here: If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some…

逻辑 · 数学 2007-05-23 Martin Goldstern , Saharon Shelah

We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…

高能物理 - 理论 · 物理学 2020-03-06 Kallol Sen , Masahito Yamazaki

For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…

经典分析与常微分方程 · 数学 2019-09-17 Vladimir Bolotnikov

We completely determine upper-modular, codistributive and costandard elements in the lattice of all commutative semigroup varieties. In particular, we prove that the properties of being upper-modular and codistributive elements in the…

群论 · 数学 2015-01-20 B. M. Vernikov

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

逻辑 · 数学 2011-02-11 Alex Primavesi , Katherine Thompson

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

群论 · 数学 2017-08-02 Vítězslav Kala

An $L(2, 1)$-labeling of a graph $G$ is an assignment of a nonnegative integer to each vertex of $G$ such that adjacent vertices receive integers that differ by at least two and vertices at distance two receive distinct integers. The span…

组合数学 · 数学 2015-03-25 Xiangwen Li , Sanming Zhou

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and…

组合数学 · 数学 2007-05-25 Matthias Beck , Thomas Zaslavsky

Let $\Lambda$ be a finite-dimensional algebra over a field $K$. We describe how Buan and Marsh's $\tau$-exceptional sequences can be used to give a "brick labeling" of a certain poset of wide subcategories of finitely-generated…

表示论 · 数学 2022-09-26 Emily Barnard , Eric J. Hanson

We show that the poset of alternating sign matrices, with Bruhat order, is isomorphic to the poset of certain submodules of the dominant Verma module for the special linear Lie algebra $\frak{sl}_n$. The latter poset consists of the…

表示论 · 数学 2021-08-18 Hankyung Ko

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

组合数学 · 数学 2014-12-04 Samuel Fiorini , Selim Rexhep

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

群论 · 数学 2026-03-09 Sachin Ballal , Tushar Halder

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

组合数学 · 数学 2026-05-14 Nathan Reading