English
Related papers

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

200 papers

Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…

Numerical Analysis · Mathematics 2025-04-09 Xiangmin Jiao , Hongji Gao

In analogy with the regularity lemma of Szemer\'edi, regularity lemmas for polynomials shown by Green and Tao (Contrib. Discrete Math. 2009) and by Kaufman and Lovett (FOCS 2008) modify a given collection of polynomials \calF =…

Computational Complexity · Computer Science 2013-11-21 Arnab Bhattacharyya , Pooya Hatami , Madhur Tulsiani

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

Number Theory · Mathematics 2017-09-18 Anthony Poels

Consider a standard representation $\pi_{st}$ of a quasi-split reductive p-adic group G. The generalized injectivity conjecture, posed by Casselman and Shahidi, asserts that any generic irreducible subquotient $\pi$ of $\pi_{st}$ is…

Representation Theory · Mathematics 2026-04-27 Maarten Solleveld

We develop a novel technique, which we call poset splitting, that allows us to solve two open problems regarding minimality of finite models of spaces: the nonexistence of a finite model of the real projective plane with fewer than 13…

Algebraic Topology · Mathematics 2015-12-21 Nicolás Cianci , Miguel Ottina

Hujter and L\'angi introduced the $k$-fold Borsuk number of a set $S$ in Euclidean $n$-space of diameter $d > 0$ as the smallest cardinality of a family $\mathcal F$ of subsets of $S$, of diameters strictly less than $d$, such that every…

Metric Geometry · Mathematics 2013-11-27 Zsolt Lángi , Márton Naszódi

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

Logic · Mathematics 2018-04-26 Kameryn J Williams

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

Optimization and Control · Mathematics 2026-03-03 Hongyu Cheng , Amitabh Basu

Let P be a poset with elements 1,2,...,n. We say that P is sign-balanced if exactly half the linear extensions of P (regarded as permutations of 1,2,...,n) are even permutations, i.e., have an even number of inversions. This concept first…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

Combinatorics · Mathematics 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

Effect algebras and pseudoeffect algebras were introduced by Foulis, Bennett, Dvurecenskij and Vetterlein as so-called quantum structures which serve as an algebraic axiomatization of the logic of quantum mechanics. A natural question…

Logic · Mathematics 2019-07-08 Ivan Chajda , Helmut Länger

By analyzing the singularity of standard intertwining operators, we provide a new way to understand the explicit location of reducibility points of induced representations of two Speh representations for general linear groups over a p-adic…

Representation Theory · Mathematics 2021-12-06 Caihua Luo

We provide a method for formulating superintegrable magnetic geodesic flows on reductive homogeneous spaces $M=G/A$, with $G$ a compact semisimple Lie group and $A$ a closed subgroup of $G$. In the twisted cotangent bundle…

Mathematical Physics · Physics 2026-05-14 Kai Jiang , Guorui Ma , Ian Marquette , Junze Zhang , Yao-Zhong Zhang

We establish an analogue of the Zariski--Nagata purity theorem for finite \'etale covers on smooth schemes over Pr\"ufer rings by demonstrating Auslander's flatness criterion in this non-Noetherian context. We derive an Auslander--Buchsbaum…

Algebraic Geometry · Mathematics 2024-02-02 Ning Guo , Fei Liu

In 2010, Olson \& Robinson [Transactions of the American Mathematical Society, 362(1), 145-168] introduced the notion of an almost homogeneous metric space and showed that if $X$ is a subset of a Hilbert space such that $X-X$ is almost…

Functional Analysis · Mathematics 2020-01-09 Alexandros Margaris

In the 1970s Deuber introduced the notion of $(m,p,c)$-sets in $\mathbb{N}$ and showed that these sets are partition regular and contain all linear partition regular configurations in $\mathbb{N}$. In this paper we obtain enhancements and…

Combinatorics · Mathematics 2016-05-13 Vitaly Bergelson , John H. Johnson , Joel Moreira

We continue the study on sheaves of rings on finite posets. We present examples where the ring of global sections coincide with toric faces rings, quotients of a polynomial ring by a monomial ideal and algebras with straightening laws. We…

Commutative Algebra · Mathematics 2021-05-18 Morten Brun , Tim Roemer

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Combinatorics · Mathematics 2009-05-20 Kari Ragnarsson , Bridget Eileen Tenner