English
Related papers

Related papers: On Bruen chains

200 papers

We study the existence of almost complex structures on even-dimensional sphere bundles over complex projective spaces. For bundles $\xi_{n,q}$ with fibre $S^{2q}$ over $\mathbb{C} P^n$, we establish a necessary condition: if $q \ge a(n)$…

Algebraic Topology · Mathematics 2026-02-17 Chengwan Liu , Huijun Yang

We prove the non existence of quantum caps of sizes 37 and 39. This completes the spectrum of quantum caps in PG(4, 4). This also implies the non existence of linear [[37,27,4]] and [[39,29,4]]-codes. The problem of the existence of non…

Combinatorics · Mathematics 2009-12-23 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

In this work we find new minimum sizes for the maximal partial spreads of PG$(3,q)$, for $q=8,9,16$ and for every $q$ such that $25\leq q\leq 101$. Furthermore, for $q=8,9,16,25$ and 27 we find all the unknown sizes between our minimums and…

Combinatorics · Mathematics 2011-11-15 Maurizio Iurlo , Sandro Rajola

The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…

Number Theory · Mathematics 2025-09-25 Jialai She

We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.

Number Theory · Mathematics 2010-09-28 Teresa Boggio , Andrea Mori

This paper proves that convex Brunnian links exist for every dimension $n \geq 3$ by constructing explicit examples. These examples are three-component links which are higher-dimensional generalizations of the Borromean rings.

Geometric Topology · Mathematics 2012-10-29 Robert Davis , Hugh Howards , Jonathan Newman , Jason Parsley

In this paper, we show that a set of q+a hyperplanes, q>13, a<(q-10)/4, that does not cover PG(n,q), does not cover at least q^(n-1)-aq^(n-2) points, and show that this lower bound is sharp. If the number of non- covered points is at most…

Combinatorics · Mathematics 2012-10-04 Stefan Dodunekov , Leo Storme , Geertrui Van de Voorde

A curve over a field k is pointless if it has no k-rational points. We show that there exist pointless genus-3 hyperelliptic curves over a finite field F_q if and only if q < 26, that there exist pointless smooth plane quartics over F_q if…

Number Theory · Mathematics 2010-01-23 Everett W. Howe , Kristin E. Lauter , Jaap Top

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…

Computational Geometry · Computer Science 2023-03-22 Daniel Rutschmann , Manuel Wettstein

A long-standing conjecture of Berge suggests that every bridgeless cubic graph can be expressed as a union of at most five perfect matchings. This conjecture trivially holds for $3$-edge-colourable cubic graphs, but remains widely open for…

Combinatorics · Mathematics 2025-01-10 Ján Karabáš , Edita Máčajová , Roman Nedela , Martin Škoviera

We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for…

Combinatorics · Mathematics 2025-03-24 Konstantin Vorob'ev

We compute the chains associated to the left-invariant CR structures on the three-sphere. These structures are characterized by a single real modulus $a$. For the standard structure $a=1$, the chains are well-known and are closed curves. We…

Complex Variables · Mathematics 2008-06-16 Alex L. Castro , Richard Montgomery

We prove that on $\mathbb{P}^{3}$ there is no exceptional bundle with rank $r=2d^{2}+1$ and degree $d$ for every $|d|\geq 4$. In particular, we find a new obstruction for the existence of exceptional bundles other than $r|(2d^{2}+1)$. We…

Algebraic Geometry · Mathematics 2023-08-23 Yeqin Liu

Let $K=\mathbb{Q}(\sqrt{-p})$ be a quadratic field for an odd prime $p$. We show that there exist infinitely many primes $p$ for which no elliptic curve $E/\mathbb{Q}$ has torsion subgroup $\mathbb{Z}/2\mathbb{Z}\times…

Number Theory · Mathematics 2026-02-10 Omer Avci

We prove the non-existence of strongly regular graph with parameters $(76,30,8,14)$. We use Euclidean representation of a strongly regular graph together with a new lower bound on the number of 4-cliques to derive strong structural…

Combinatorics · Mathematics 2017-04-20 A. V. Bondarenko , A. Prymak , D. Radchenko

The maximum number of non-crossing straight-line perfect matchings that a set of $n$ points in the plane can have is known to be $O(10.0438^n)$ and $\Omega^*(3^n)$. The lower bound, due to Garc\'ia, Noy, and Tejel (2000) is attained by the…

Computational Geometry · Computer Science 2017-11-20 Andrei Asinowski , Günter Rote

In 1972, Kainen proved a general lower bound on the crossing number of a graph in a closed surface and conjectured that this bound is tight when the graph is either a complete graph or a complete bipartite graph, and the surface is of genus…

Combinatorics · Mathematics 2024-05-13 Timothy Sun

Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…

Combinatorics · Mathematics 2018-01-01 Mariusz Kwiatkowski , Mark Pankov , Antonio Pasini

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…

Combinatorics · Mathematics 2025-11-20 Sam Adriaensen , Peter Sziklai , Zsuzsa Weiner

A recent result of Bokal et al. [Combinatorica, 2022] proved that the exact minimum value of c such that c-crossing-critical graphs do not have bounded maximum degree is c=13. The key to that result is an inductive construction of a family…

Combinatorics · Mathematics 2024-03-04 Petr Hliněný , Michal Korbela
‹ Prev 1 2 3 10 Next ›