English
Related papers

Related papers: Note on Ramsey theorem for posets with linear exte…

200 papers

The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has…

Combinatorics · Mathematics 2021-08-24 Stefan Felsner , Torsten Ueckerdt , Kaja Wille

For a partially ordered set $(A, \le)$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a \neq b\in A$ are adjacent if either $a \le b$ or $b \le a$. We call $G_A$ the \emph{partial order graph} or…

Combinatorics · Mathematics 2020-10-22 Ayman Badawi , Roswitha Rissner

We consider a Ramsey statement for pairs of maps between trees, where one is an embedding as defined by Deuber and the other is a rigid surjection as defined by Solecki. We show that there is no Ramsey Theorem for pairs of maps where the…

Combinatorics · Mathematics 2025-07-30 Sebastian Junge

We survey all known examples of finite posets whose order polynomials have product formulas, and we propose the heuristic that these are the same posets with good dynamical behavior. Here the dynamics in question are the actions of…

Combinatorics · Mathematics 2024-08-09 Sam Hopkins

We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.

Combinatorics · Mathematics 2012-11-29 Valentin Féray , Victor Reiner

Sectional pseudocomplementation (sp-complementation) on a poset is a partial operation $*$ which associates with every pair $(x,y)$ of elements, where $x \ge y$, the pseudocomplement $x*y$ of $x$ in the upper section $[y)$. Any total…

Combinatorics · Mathematics 2022-11-02 Jānis Cīrulis

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

Combinatorics · Mathematics 2023-06-22 János Balogh , Cosmin Bonchiş , Diana Diniş , Gabriel Istrate , Ioan Todinca

The paper presents a new short proof of one of Adams's theorems and a $t$-trace-class theorem for parabolic Morrey spaces.

Analysis of PDEs · Mathematics 2024-12-24 N. V. Krylov

In this paper we show that several classes of partially ordered structures having paraorthomodular reducts, or whose sections may be regarded as paraorthomodular posets, admit a quite natural notion of implication, that admits a suitable…

Logic · Mathematics 2023-01-24 Ivan Chajda , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

An algebraization of the notion of topology has been proposed more than seventy years ago in a classical paper by McKinsey and Tarski. However, in McKinsey and Tarski's setting the model theoretical notion of homomorphism does not…

General Topology · Mathematics 2025-07-24 Paolo Lipparini

We obtain necessary and sufficient conditions for abelian varieties to acquire semistable reduction over fields of low degree. Our criteria are expressed in terms of torsion points of small order defined over unramified extensions.

alg-geom · Mathematics 2016-08-30 A. Silverberg , Yu. G. Zarhin

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruci\'{n}ski. Namely, for any $r \ge 2$ and $n \ge 2$, we show that any collection $\mathcal H$ of $n$ pairwise…

Combinatorics · Mathematics 2025-07-21 Lisa Sauermann , Dmitrii Zakharov

The purpose of this survey is to provide a gentle introduction to several recent breakthroughs in graph Ramsey theory. In particular, we will outline the proofs (due to various groups of authors) of exponential improvements to the diagonal,…

Combinatorics · Mathematics 2026-01-09 Robert Morris

In this paper we consider the characteristic polynomial of not necessarily ranked posets. We do so by allowing the rank to be an arbitrary function from the poset to the nonnegative integers. We will prove two results showing that the…

Combinatorics · Mathematics 2014-11-13 Joshua Hallam

We prove the equivalence of the well-posedness of a partial differential equation with delay and an associated abstract Cauchy problem. This is used to derive sufficient conditions for well-posedness, exponential stability and norm…

Functional Analysis · Mathematics 2012-12-03 András Bátkai , Susanna Piazzera

In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.

Functional Analysis · Mathematics 2020-03-16 Yongtao Li , Lihua Feng , Zheng Huang , Weijun Liu

We consider extensions of the Rattray theorem and two Makeev's theorems, showing that they hold for several maps, measures, or functions simultaneously, when we consider orthonormal $k$-frames in $\R^n$ instead of orthonormal basis (full…

Algebraic Topology · Mathematics 2012-12-27 Pavle Blagojević , Roman Karasev

In Section 6 of the paper ``Fra\"{\i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic…

Combinatorics · Mathematics 2026-05-21 Dragan Mašulović

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic