中文
相关论文

相关论文: Flag vectors of Eulerian partially ordered sets

200 篇论文

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

组合数学 · 数学 2021-11-09 Emily Eckels , Ervin Gyori , Junsheng Liu , Sohaib Nasir

We prove that, over a smooth quasi-projective curve, the set of non-isotrivial, smooth and projective families of polarized varieties with a fixed Hilbert polynomial and semi-ample canonical bundle is bounded. This extends the boundedness…

代数几何 · 数学 2026-05-26 Kenneth Ascher , Behrouz Taji

In this article, we develop a technique to "split" certain types of partially ordered sets into simpler ones and use that technique to give a partial answer to a conjecture by R. Wiegand and S. Wiegand on the structure of semi-local,…

交换代数 · 数学 2018-01-10 Cory H. Colbert

In this paper, we develop a theory of Galois descent for equivariant line bundles on partial flag schemes. In particular, we study computational aspects of the classification of descent data of equivariant line bundles attached to…

代数几何 · 数学 2023-08-17 Takuma Hayashi

The purpose of this note is to complete the study, begun in the first author's PhD thesis, of the topology of the poset of generalized noncrossing partitions associated to real reflection groups. In particular, we calculate the Euler…

组合数学 · 数学 2009-12-05 Drew Armstrong , Christian Krattenthaler

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

In this paper we study the partially ordered set Q^J of cells in Rietsch's cell decomposition of the totally nonnegative part of an arbitrary flag variety P^J_{\geq 0}. Our goal is to understand the geometry of P^J_{\geq 0}: Lusztig has…

表示论 · 数学 2007-05-23 Lauren K. Williams

Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex…

组合数学 · 数学 2023-04-24 Grahame Erskine , Terry Griggs , Robert Lewis , James Tuite

In this article we describe the Auslander-Reiten quiver for some posets with an involution, that we call types $\mathfrak{U}_n$ and $\mathfrak{U}_\infty$. These posets appear in the differentiation III of Zavadskij [12]. We follow the…

表示论 · 数学 2022-07-13 Raymundo Bautista Ramos , Verónica Cifuentes Vargas

In spectral bisection, a Fielder vector is used for partitioning a graph into two connected subgraphs according to its sign pattern. In this article, we investigate graphs having Fiedler vectors with unbalanced sign patterns such that a…

组合数学 · 数学 2023-04-13 Sooyeong Kim , Steve Kirkland

Euler-symmetric projective varieties are nondegenerate projective varieties admitting many C*-actions of Euler type. They are quasi-homogeneous and uniquely determined by their fundamental forms at a general point. We show that…

代数几何 · 数学 2017-07-24 Baohua Fu , Jun-Muk Hwang

Results of R. Stanley and M. Masuda completely characterize the h-vectors of simplicial posets whose order complexes are spheres. In this paper we examine the corresponding question in the case where the order complex is a ball. Using the…

组合数学 · 数学 2010-09-13 Samuel Kolins

Stable multivariate Eulerian polynomials were introduced by Br\"and\'en. Particularizing some variables, it is possible to extract real zero multivariate Eulerian polynomials from them. These real zero multivariate Eulerian polynomials can…

组合数学 · 数学 2025-07-25 Alejandro González Nevado

Gross, Mansour and Tucker introduced the partial-dual orientable genus polynomial and the partial-dual Euler genus polynomial. They computed these two partial-dual genus polynomials of four families of ribbon graphs, posed some research…

组合数学 · 数学 2020-06-30 Qi Yan , Xian'an Jin

This paper presents combinatorial facts dealing with the number of unlabeled partially ordered sets (posets) refined by the number of arcs in the Hasse diagram (sequence A342447 in OEIS). The main result is that the differences with respect…

组合数学 · 数学 2025-12-10 Rico Zöllner , Konrad Handrich

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…

离散数学 · 计算机科学 2024-08-14 Khaled Elbassioni

The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete…

组合数学 · 数学 2021-01-22 Peter Dankelmann

We provide weak-type bounds for a family of bilinear fractional integrals that arise in the study of Euler-Riesz systems. These bounds are uniform in the natural parameter that describes the family and are sharp, in the sense that they do…

经典分析与常微分方程 · 数学 2025-08-12 Nuno J. Alves , Loukas Grafakos

Given an open subset U of a projective curve Y and a smooth family f:V-->U of curves, with semi-stable reduction over Y, we show that for a sub variation of Hodge structures of rank >2 the Arakelov inequality must be strict. For families of…

代数几何 · 数学 2011-02-19 Eckart Viehweg , Kang Zuo

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…

组合数学 · 数学 2019-12-12 Stefan Felsner , Tamás Mészáros , Piotr Micek