English
Related papers

Related papers: Ramsey numbers and extremal structures in polar sp…

200 papers

A generalised hexagon of order $(s,t)$ is said to be \emph{extremal} if $t$ meets the Haemers-Roos bound, that is, $t=s^3$. The \emph{dual twisted triality hexagons} associated to the exceptional Lie type groups $\,^3D_4(s)$ have these…

Combinatorics · Mathematics 2014-05-22 John Bamberg

We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on $2n$ vertices are bounded by…

Combinatorics · Mathematics 2015-09-14 Josef Cibulka , Pu Gao , Marek Krčál , Tomáš Valla , Pavel Valtr

A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space over $\mathbb{F}_q$ equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A…

Combinatorics · Mathematics 2024-08-14 Charlene Weiß

For $B \subseteq \mathbb F_q^m$, the $n$-th affine extremal number of $B$ is the maximum cardinality of a set $A \subseteq \mathbb F_q^n$ with no subset which is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for any $B…

Combinatorics · Mathematics 2023-08-28 Bryce Frederickson , Liana Yepremyan

The investigation into large families of non-opposite flags in finite spherical buildings has been a recent addition to a long line of research in extremal combinatorics, extending classical results in vector and polar spaces. This line of…

Combinatorics · Mathematics 2025-05-21 Jan De Beule , Philipp Heering , Sam Mattheus , Klaus Metsch

We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…

Combinatorics · Mathematics 2016-11-29 Christopher Cox , Derrick Stolee

Bipartite Ramsey numbers is the smallest size of a complete bipartite graph $K_{N,N}$ such that every edge-coloring with a given number of colors inevitably yields a monochromatic copy of a prescribed bipartite graph. While exact values…

Combinatorics · Mathematics 2026-04-29 Meng Ji

In this paper, we obtain upper bounds for the geometric Ramsey numbers of trees. We prove that $R_c(T_n,H_m)=(n-1)(m-1)+1$ if $T_n$ is a caterpillar and $H_m$ is a Hamiltonian outerplanar graph on $m$ vertices. Moreover, if $T_n$ has at…

Combinatorics · Mathematics 2013-11-13 Pu Gao

We provide new proofs for the non-existence of ovoids in hyperbolic spaces of rank at least four in even characteristic, and for the Hermitian polar space $\mathsf{H}(5, 4)$. We also improve the results of A. Klein on the non-existence of…

Combinatorics · Mathematics 2015-09-17 John Bamberg , Jan De Beule , Ferdinand Ihringer

A {\em maximal partial ovoid} of a generalized quadrangle is a maximal set of points no two of which are collinear. The problem of determining the smallest size of a maximal partial ovoid in quadrangles has been extensively studied in the…

Metric Geometry · Mathematics 2013-08-09 Jeroen Schillewaert , Jacques Verstraete

For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.

Spectral Theory · Mathematics 2007-05-23 J. Sjoestrand , M. Zworski

It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued…

Logic · Mathematics 2026-03-06 Pietro Freni

Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…

Combinatorics · Mathematics 2022-04-01 Jurriaan Wouters , Aris Giotis , Ross Kang , Dirk Schuricht , Lars Fritz

We provide polynomial upper bounds for the minimal sizes of distal cell decompositions in several kinds of distal structures, particularly weakly $o$-minimal and $P$-minimal structures. The bound in general weakly $o$-minimal structures…

Logic · Mathematics 2026-02-11 Aaron Anderson

We consider partitions $p_{w}(n)$ of a positive integer $n$ arising from the generating functions \[ \sum_{n=1}^\infty p_{w}(n) z^n = \prod_{m \in \mathbb{N}} (1-z^m)^{-w(m)}, \] where the weights $w(m)$ are M\"{o}bius convolutions. We…

Number Theory · Mathematics 2026-03-04 Debmalya Basak , Nicolas Robles , Alexandru Zaharescu

We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…

Logic in Computer Science · Computer Science 2025-12-16 Damian Niwiński , Paweł Parys , Michał Skrzypczak

Let $\cal P$ be a finite classical polar space of rank $d$. An $m$-regular system with respect to $(k - 1)$-dimensional projective spaces of $\cal P$, $1 \le k \le d - 1$, is a set $\cal R$ of generators of $\cal P$ with the property that…

Combinatorics · Mathematics 2021-03-18 Antonio Cossidente , Giuseppe Marino , Francesco Pavese , Valentino Smaldore

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…

Analysis of PDEs · Mathematics 2024-04-04 Pascal Auscher , Moritz Egert

We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…

Combinatorics · Mathematics 2021-05-27 Antonio Pasini