中文
相关论文

相关论文: The Endomorphism Conjecture for Graded Posets of W…

200 篇论文

The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most…

组合数学 · 数学 2013-10-29 Edward D. Kim , Francisco Santos

We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…

组合数学 · 数学 2021-08-02 Ewan Davies , Matthew Jenssen , Will Perkins

We consider the problem of determining the maximum number of pairs $F\subseteq F'$ in a family $\mathcal{F}\subseteq 2^{[n]}$ that avoids certain posets $P$ of height 2. We show that for any such $P$ the number of pairs is…

组合数学 · 数学 2021-11-17 Dániel Nagy , Balázs Patkós

In this article we study the endomorphism algebras of abelian varieties $A$ defined over a given number field $K$ with large cyclic 2-torsion fields. A key step in doing so is to provide criteria for all the endomorphisms of $A$ to be…

数论 · 数学 2026-03-24 Pip Goodman

We produce a criterion for open sets in projective $n$-space over a separably closed field to have \'etale cohomological dimension bounded by $2n-3$. We use the criterion to exhibit a scheme for which \'etale cohomological dimension is…

交换代数 · 数学 2010-12-01 Manoj Kummini , Uli Walther

We show that there is no 4-dimensional analogue of the 5-prismatoids used in Santos' recent counterexample to the Hirsch conjecture.

组合数学 · 数学 2011-04-19 Tamon Stephen , Hugh Thomas

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

概率论 · 数学 2007-05-23 Adam Hammett , Boris Pittel

This is an expository paper based on the results in [12] and [16]. The main goal is to prove the following two conjectures for genus up to two. (1) Witten's conjecture on the relations between higher spin curves and Gelfand-Dickey…

代数几何 · 数学 2007-05-23 Y. -P. Lee

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

组合数学 · 数学 2022-10-11 Jineon Baek

Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…

数论 · 数学 2020-07-07 Wade Hindes

We show that determining if an $n$-vertex graph has twin-width at most 4 is NP-complete, and requires time $2^{\Omega(n/\log n)}$ unless the Exponential-Time Hypothesis fails. Along the way, we give an elementary proof that $n$-vertex…

计算复杂性 · 计算机科学 2021-12-17 Pierre Bergé , Édouard Bonnet , Hugues Déprés

We give the first examples of finitely determined map-germs of corank 3 defined from 3-space to 4-space. We show that they support Mond's conjecture which states that the image Milnor number is greater than or equal to…

代数几何 · 数学 2017-02-21 Ayse Sharland

let f be an endomorphism of a complex projective space, of degree bigger than one. Let us call an algebraic subset exceptional for f, if its inverse image is set-theoretically equal to itself. J.-Y. Briend, S. Cantat and M. Shishikura…

代数几何 · 数学 2007-05-23 E. Amerik , F. Campana

We give a new proof of the Hodge conjecture for abelian fourfolds of Weil type with discriminant 1 and all of their powers. The Hodge conjecture for these abelian fourfolds was proven by Markman using hyperholomorphic sheaves on…

代数几何 · 数学 2026-02-11 Salvatore Floccari , Lie Fu

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…

组合数学 · 数学 2014-04-18 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

组合数学 · 数学 2023-09-12 Bernd S. W. Schröder

A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that any diameter-2-critical graph of order n has at most…

组合数学 · 数学 2026-04-17 Antoine Dailly , Florent Foucaud , Adriana Hansberg

In this expository note we present a proof of the V.A. Vassiliev conjecture on the planarity of graphs with vertices of degree 4 and certain additional structure. Both statement and proof are accessible to high-school students familiar with…

组合数学 · 数学 2018-10-02 Arkadiy Skopenkov

We propose a new method, using deformation theory, to study the maximal rank conjecture. For line bundles of extremal degree, which can be viewed as the first case to test the conjecture, we prove that maximal rank conjecture holds by our…

代数几何 · 数学 2010-04-08 Jie Wang

We study maximum antichains in two posets related to quiver representations. Firstly, we consider the set of isomorphism classes of indecomposable representations ordered by inclusion. For various orientations of the Dynkin diagram of type…

表示论 · 数学 2016-08-12 Florian Gellert , Philipp Lampe