English
Related papers

Related papers: Chains of P-points

200 papers

We generalize the definition of overconvergent $p$-adic multiple polylogarithms and of $p$-adic cyclotomic multiple zeta values and we prove a bound on their norm. A byproduct of the proof is a characterization of these objects in terms of…

Number Theory · Mathematics 2020-05-21 David Jarossay

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

Number Theory · Mathematics 2025-08-22 Trey Smith , Aksel Ozer

The separately continuity topology is considered and some its properties are investigated. With help of these properties a generalization of Sierpinski theorem on determination of real separately continuous function by its values on an…

General Topology · Mathematics 2016-01-28 V. V. Mykhaylyuk

We show that if either the process is strong Feller and the boundary point is probabilistically regular for the stopping set, or the process is strong Markov and the boundary point is probabilistically regular for the interior of the…

Probability · Mathematics 2020-04-16 Tiziano De Angelis , Goran Peskir

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…

Logic in Computer Science · Computer Science 2023-06-22 Jérémy Dubut , Akihisa Yamada

The goal of this paper is to establish a general fixed point theorem for compact single-valued continuous mapping in Hausdorff p-vector spaces, and the fixed point theorem for upper semicontinuous set-valued mappings in Hausdorff locally…

Functional Analysis · Mathematics 2023-04-13 George Xianzhi Yuan

We present a form convergence theorem for sequences of sectorial forms and their associated semigroups in a complex Hilbert space. Roughly speaking, the approximating forms $a_n$ are all `bounded below' by the limiting form $a$, but in…

Functional Analysis · Mathematics 2023-03-16 Hendrik Vogt , Jürgen Voigt

Let $\gamma_i(G)$ and $Z_i(G)$ denote the $i$-th terms of the lower and upper central series of a group $G$, respectively. P. Hall showed that if $\gamma_{i+1}(G)$ is finite then the index $|G:Z_{2i}(G)|$ is finite. We prove that the same…

Group Theory · Mathematics 2007-12-24 Gustavo Fernandez Alcobér , Marta Morigi

The notion of typical sequences plays a key role in the theory of information. Central to the idea of typicality is that a sequence $x_1, x_2, ..., x_n$ that is $P_X$-typical should, loosely speaking, have an empirical distribution that is…

Information Theory · Computer Science 2010-05-14 Patrick Mitran

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph $G$ with $\delta(G)\ge C$ contains a cycle of length $\ell\ge 4$ with $\Omega(\ell/\log^{C}\ell)$ chords for some…

Combinatorics · Mathematics 2026-01-14 Nemanja Draganić , António Girão

In this short note we confirm a conjecture of James Wiegold. We prove that if $G$ is a finite $p$-group and $|G'|>p^{n(n-1)/2}$ for some non-negative integer $n$, then the group $G$ can be generated by the elements of breadth at least $n$.…

Group Theory · Mathematics 2018-04-06 Alexander Skutin

We study higher order convexity properties of random point sets in the unit square. Given $n$ uniform i.i.d random points, we derive asymptotic estimates for the maximal number of them which are in $k$-monotone position, subject to mild…

Metric Geometry · Mathematics 2020-09-30 Gergely Ambrus

We investigate the order of the $r$-th, $1\le r < +\infty$, central moment of the length of the longest common subsequence of two independent random words of size $n$ whose letters are identically distributed and independently drawn from a…

Probability · Mathematics 2016-04-22 Christian Houdré , Jinyong Ma

In a dynamical system $(X,f)$, with $X$ a compact metric space, the chain components, the fundamental building blocks in the Conley decomposition of dynamics, have a natural partial order induced by the chain relation between points.…

Dynamical Systems · Mathematics 2026-03-31 P. Cintioli , A. Della Corte , M. Farotti

We prove the potential density of rational points on the variety of lines of a sufficiently general cubic fourfold defined over a number field, where ``sufficiently general'' means that a condition of Terasoma type is satisfied. These…

Algebraic Geometry · Mathematics 2007-07-27 Ekaterina Amerik , Claire Voisin

The main results in this note concern the characterization of the length of continua 1 (Theorems 2.5) and the parametrization of continua with finite length (Theorem 4.4). Using these results we give two independent and relatively…

Classical Analysis and ODEs · Mathematics 2017-10-06 Giovanni Alberti , Martino Ottolini

A continuous map C^d -> C^N is a complex k-regular embedding if any k pairwise distinct points in C^d are mapped by f into k complex linearly independent vectors in C^N. Our central result on complex k-regular embeddings extends results of…

Algebraic Topology · Mathematics 2015-10-28 Pavle V. M. Blagojević , Frederick R. Cohen , Wolfgang Lück , Günter M. Ziegler

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

Combinatorics · Mathematics 2022-07-25 Yair Caro , John R. Schmitt

The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we…

Logic in Computer Science · Computer Science 2025-11-05 Florian Bruse , David Kronenberger , Martin Lange