English
Related papers

Related papers: Chains of P-points

200 papers

We prove that if an ultrafilter L is not coherent to a Q-point, then each analytic non-sigma-bounded topological group G admits an increasing chain <G_a : a < b(L)> of its proper subgroups such that: (i) U_{a in b(L)} G_a=G; and $(ii)$ For…

Logic · Mathematics 2011-04-15 Taras Banakh , Dušan Repovš , Lyubomyr Zdomskyy

We introduce a self-reinforced point processes on the unit interval that appears to exhibit self-organized criticality, somewhat reminiscent of the well-known Bak-Sneppen model. The process takes values in the finite subsets of the unit…

Probability · Mathematics 2017-01-20 Jan M. Swart

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

Number Theory · Mathematics 2014-12-17 James Maynard

We show that $\mathrm{MA}_{\kappa}$ implies that each collection of ${P}_{\mathfrak c}$-points of size at most $\kappa$ which has a $P_{\mathfrak c}$-point as an $RK$ upper bound also has a ${P}_{\mathfrak c}$-point as an $RK$ lower bound.

Logic · Mathematics 2022-04-27 Borisa Kuzeljevic , Dilip Raghavan , Jonathan L. Verner

The aim of this paper is to generalize some fixed point theorems in the class of convex contraction of order $m$ on a complete suprametric space. Then, we will prove that the class of convex contraction of order m is strong enough to…

General Mathematics · Mathematics 2026-05-11 Nicola Fabiano , Sedigheh Barootkoob , Hossein Lakzian

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

This paper establishes an abstract Korovkin-type approximation theorem in general spaces, extending the framework of approximation theory to accommodate broader contexts. A critical result supporting this theorem is the proof that any…

Functional Analysis · Mathematics 2025-09-03 Dilek Söylemez , Mehmet Ünver

We prove that all bounded subsets of $\mathbb{Q}_p^n$ containing a line segment of unit length in every direction have Hausdorff and Minkowski dimension $n$. This is the analogue of the classical Kakeya conjecture with $\mathbb{R}$ replaced…

Number Theory · Mathematics 2021-11-02 Bodan Arsovski

Sperner's bound on the size of an antichain in the lattice P(S) of subsets of a finite set S has been generalized in three different directions: by Erdos to subsets of P(S) in which chains contain at most r elements; by Meshalkin to certain…

Combinatorics · Mathematics 2007-05-25 Matthias Beck , Xueqin Wang , Thomas Zaslavsky

In this article we show that some recent results on the existence of best proximity points can be obtained from the same result in fixed point theory.

Functional Analysis · Mathematics 2013-01-31 Ali Abkar , Moosa Gabeleh

We prove two results concerning percolation on general graphs. - We establish the converse of the classical Peierls argument: if the critical parameter for (uniform) percolation satisfies $p_c<1$, then the number of minimal cutsets of size…

Probability · Mathematics 2025-10-15 Philip Easo , Franco Severo , Vincent Tassion

In this paper we consider reducibility points beyond the ends of complementary series of general linear groups over a p-adic field, which start with Speh representations. We describe explicitly the composition series of the representations…

Representation Theory · Mathematics 2014-07-10 Marko Tadic

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

Combinatorics · Mathematics 2007-10-23 Andy Frohmader

We prove that for any circulant matrix $C$ of size $n\times n$ with the monic characteristic polynomial $p(z)$, the spectrum of its $(n-1)\times(n-1)$ submatrix $C_{n-1}$ constructed with first $n-1$ rows and columns of $C$ consists of all…

Classical Analysis and ODEs · Mathematics 2025-07-01 Olga Kushel , Mikhail Tyaglov

We prove that globally $+$-regular varieties are rationally chain connected in dimension three and mixed characteristic with residue field characteristic $p>5$. We also introduce a notion of strongly globally $+$-regular, and show that…

Algebraic Geometry · Mathematics 2026-02-20 Emre Alp Özavcı , Zsolt Patakfalvi , Kevin Tucker , Joe Waldron , Zheng Xu

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Algebraic Geometry · Mathematics 2025-09-03 Andreas Blatter , Jan Draisma , Filip Rupniewski

Let G be a transitive group of permutations of a finite set X, and suppose that some element of G has at most two orbits on X. We prove that any two maximal chains of groups between G and a point-stabilizer of G have the same length, and…

Group Theory · Mathematics 2007-12-27 Greg Kuperberg , Michael Zieve

The main result of [4] is that all finitely presented groups of p-deficiency greater than one are p-large. Here we prove that groups with a finite presentation of p-deficiency one possess a finite index subgroup that surjects onto . This…

Group Theory · Mathematics 2011-08-02 Anitha Thillaisundaram

The two closely related Lorentz-invariant partial orders of space-time are distinguished with respect to the existence of antichain cutsets and the possibility of grading. World lines of particles with or without mass are the maximal chains…

Mathematical Physics · Physics 2018-02-27 Stephan Foldes

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

Combinatorics · Mathematics 2008-07-11 Joshua Cooper , Mark Walters