English
Related papers

Related papers: Counterexamples to the B-spline conjecture for Gab…

200 papers

In this paper, we show that a small minimal k-blocking set in PG(n, q3), q = p^h, h >= 1, p prime, p >=7, intersecting every (n-k)-space in 1 (mod q) points, is linear. As a corollary, this result shows that all small minimal k-blocking…

Combinatorics · Mathematics 2012-01-17 Michel Lavrauw , Leo Storme , Geertrui Van de Voorde

Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…

Data Structures and Algorithms · Computer Science 2019-08-27 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Thomas Schneck

We propose a framework to prove Malle's conjecture for the compositum of two number fields based on proven results of Malle's conjecture and good uniformity estimates. Using this method we can prove Malle's conjecture for $S_n\times A$ over…

Number Theory · Mathematics 2021-02-24 Jiuya Wang

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

Combinatorics · Mathematics 2019-03-22 Ilkyoo Choi , Ringi Kim , Alexandr Kostochka , Boram Park , Douglas B. West

It is a classical result of Harper that the limiting distribution of the number of blocks in partitions of the set $\{1, 2,..., n\}$ is normal. In this paper, using the saddle point method we prove the normality of the limiting distribution…

Combinatorics · Mathematics 2011-08-08 David G. L. Wang

We consider the frame property of the Gabor system G(g, {\alpha}, {\beta}) = {e2{\pi}i{\beta}nt g(t - {\alpha}m) : m, n \in Z} for the case of rational oversampling, i.e. {\alpha}, {\beta} \in Q. A 'rational' analogue of the Ron-Shen…

Information Theory · Computer Science 2011-08-15 Yurii Lyubarskii , Preben Gråberg Nes

In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\leq \delta(G)\leq \Delta(G)\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $\Delta(G)$ and $\delta(G)$…

Combinatorics · Mathematics 2012-08-13 Petros A. Petrosyan

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

Combinatorics · Mathematics 2026-04-15 J. Nesetril , P. Ossona de Mendez

We established a hyperplane restriction theorem for the local holomorphic mappings between projective spaces, which is inspired by the corresponding theorem of Green for homogeneous ideals in polynomial rings. Our theorem allows us to give…

Complex Variables · Mathematics 2021-12-24 Yun Gao , Sui-Chung Ng

For a curve over a global field we consider for which integers d the d-primary part of the Brauer group can obstruct the existence of rational points. We give examples showing it is possible that there is a d-primary obstruction for…

Number Theory · Mathematics 2017-11-03 Brendan Creutz , Bianca Viray , José Felipe Voloch

A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies.…

Combinatorics · Mathematics 2019-02-19 Carl Feghali

We show that the frame measure function of a frame in certain reproducing kernel Hilbert spaces on metric measure spaces is given by the reciprocal of the Beurling density of its index set. In addition, we show that each such frame with…

Functional Analysis · Mathematics 2025-12-30 Marcin Bownik , Jordy Timo van Velthoven

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

Combinatorics · Mathematics 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of…

Combinatorics · Mathematics 2011-12-16 Daniel Heldt , Kolja Knauer , Torsten Ueckerdt

Recently Braga and Mello conjectured that for a given natural number n there is a piecewise linear system with two zones in the plane with exactly n limit cycles. In this paper we prove a result from which the conjecture is an immediate…

Dynamical Systems · Mathematics 2015-04-29 Douglas Duarte Novaes , Enrique Ponce

In the edge-2star model with hard constraints we prove the existence of an open set of constraint parameters, bisected by a line segment on which there are nonunique entropy-optimal graphons related by a symmetry. At each point in the open…

Probability · Mathematics 2026-01-26 Charles Radin , Lorenzo Sadun

For finite dimensional algebras over algebraically closed fields, we study the sets of pairwise Hom-orthogonal modules and obtain new results on some open conjectures on the behaviour of bricks and several related problems, which we…

Representation Theory · Mathematics 2025-02-18 Kaveh Mousavand , Charles Paquette

$R_+^{n\times n}$ denotes the set of $n\times n$ non-negative matrices. For $A\in R_+^{n\times n}$ let $\Omega(A)$ be the set of all matrices that can be formed by permuting the elements within each row of $A$. Formally: $$\Omega(A)=\{B\in…

Rings and Algebras · Mathematics 2023-05-29 Gernot Michael Engel , Sergei Sergeev

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Group Theory · Mathematics 2009-01-14 Alireza Abdollahi

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen…

Combinatorics · Mathematics 2018-04-26 Maarten De Boeck , Geertrui Van de Voorde