English
Related papers

Related papers: On embedding certain partial orders into the P-poi…

200 papers

Motivated by a question of Isbell, we show that Jensen's Diamond Principle implies there is a non-P-point ultrafilter U on omega such that U, whether ordered by reverse inclusion or reverse inclusion mod finite, is not Tukey equivalent to…

Logic · Mathematics 2010-01-05 David Milovich

In the early 1970's, Richard Stanley and Kenneth Johnson introduced and laid the groundwork for studying the order polynomial of partially ordered sets (posets). Decades later, Hamaker, Patrias, Pechenik, and Williams introduced the term…

Combinatorics · Mathematics 2018-07-27 Thomas Browning , Max Hopkins , Zander Kelley

These series of notes serve as an introduction to some of both the classical and modern techniques in Reifenberg theory. At its heart, Reifenberg theory is about studying general sets or measures which can be, in one sense or another,…

Analysis of PDEs · Mathematics 2018-12-19 Aaron Naber

In a companion paper, a canonical bijection was established between strong formal subdivisions of lower Eulerian posets and triples consisting of a lower Eulerian poset, a corresponding rank function, and a non-minimal element such that the…

Combinatorics · Mathematics 2025-11-21 Alan Stapledon

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

Combinatorics · Mathematics 2026-02-05 Gi-Sang Cheon , Hong Joon Choi , Gukwon Kwon , Hojoon Lee , Yaling Wang

In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance between points in the same part of the partition is minimized.…

Computational Geometry · Computer Science 2024-04-08 Henry Fleischmann , Kyrylo Karlov , Karthik C. S. , Ashwin Padaki , Stepan Zharkov

We prove that for any semi-Dirichlet form $(\epsilon, D(\epsilon))$ on a measurable Lusin space $E$ there exists a Lusin topology with the given $\sigma$-algebra as the Borel $\sigma$-algebra so that $(\epsilon, D(\epsilon))$ becomes…

Probability · Mathematics 2007-05-23 Lucian Beznea , Nicu Boboc , Michael Röckner

The generic ultrafilter $\mathcal{G}_2$ forced by $\mathcal{P}(\omega\times\omega)/($Fin$\otimes$Fin) was recently proved to be neither maximum nor minimum in the Tukey order of ultrafilters (in a recent paper of Blass, Dobrinen, and…

Logic · Mathematics 2014-06-06 Natasha Dobrinen

Let $\mathbf{G}$ be an unramified quasi-split unitary group over a p-adic field of odd residual characteristic. The goal of this paper is to describe the supercuspidal representations within certain L-packets of $\mathbf{G}$, which are…

Representation Theory · Mathematics 2015-12-29 Kam Fai Tam

We continue the study of the pseudo-intersection property with respect to an ideal introduced in \cite{TomNatasha2}. Our theory applies to the study of the Tukey types of general sums of ultrafilters, which, as evidenced by the results of…

Logic · Mathematics 2025-12-10 Tom Benhamou

The problem of two fixed centers is a classical integrable problem, stated and integrated by Euler in 1760. The integrability is due to the unexpected first integral $G$. Some straightforward generalizations of the problem still have the…

Chaotic Dynamics · Physics 2007-05-23 A. Albouy , T. J. Stuchi

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz

We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…

Combinatorics · Mathematics 2024-08-30 Mathilde Bouvel , Luca Ferrari , Bridget Eileen Tenner

We prove that if $X$ is a topological space that admits Debreu's classical utility theorem (eg.\ $X$ is separable and connected, second countable, etc.), then order relations on $X$ satisfying milder completeness conditions can be…

Economics · Quantitative Finance 2021-01-21 Lawrence Carr

We define the quantile set of order $\alpha \in \left[ 1/2,1\right) $ associated to a law $P$ on $\mathbb{R}^{d}$ to be the collection of its directional quantiles seen from an observer $O\in \mathbb{R}^{d}$. Under minimal assumptions these…

Statistics Theory · Mathematics 2016-12-06 Adil Ahidar-Coutrix , Philippe Berthet

This paper introduces the seed order, a partial order of the class of uniform countably complete ultrafilters that generalizes the Mitchell order on normal measures. Like that order, the seed order is consistently a linear ordering even…

Logic · Mathematics 2017-06-06 Gabriel Goldberg

In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…

Logic · Mathematics 2023-11-13 Davide Fazio , Raffaele Mascella

We investigate the complexity of solving stable or perturbation-resilient instances of $k$-Means and $k$-Median clustering in fixed dimension Euclidean metrics (more generally doubling metrics). The notion of stable (perturbation resilient)…

Data Structures and Algorithms · Computer Science 2024-02-01 Zachary Friggstad , Kamyar Khodamoradi , Mohammad R. Salavatipour

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

Logic · Mathematics 2023-10-17 Miloš S. Kurilić , Stevo Todorčević