English
Related papers

Related papers: On pseudo-arcs from normal rational curve and addi…

200 papers

In this paper, we prove that every non-elementary subgroup of the mapping class group of a surface has non-arithmetic Teichm\"uller length spectrum. Namely, Teichm\"uller translation lengths of its pseudo-Anosov elements generate a dense…

Geometric Topology · Mathematics 2026-05-14 Inhyeok Choi , Dongryul M. Kim

An $n$-arc in a projective plane is a collection of $n$ distinct points in the plane, no three of which lie on a line. Formulas counting the number of $n$-arcs in any finite projective plane of order $q$ are known for $n \le 8$. In 1995,…

Combinatorics · Mathematics 2017-06-13 Nathan Kaplan , Susie Kimport , Rachel Lawrence , Luke Peilen , Max Weinreich

In this paper we compute the generating function of modular, $k$-noncrossing diagrams. A $k$-noncrossing diagram is called modular if it does not contains any isolated arcs and any arc has length at least four. Modular diagrams represent…

Combinatorics · Mathematics 2019-10-15 Christian M. Reidys , Rita R. Wang , Y. Y. Zhao

For a finite set $P$ of points in the plane in general position, a \emph{crossing family} of size $k$ in $P$ is a collection of $k$ line segments with endpoints in $P$ that are pairwise crossing. It is a long-standing open problem to…

Combinatorics · Mathematics 2025-08-26 Todor Antić , Martin Balko , Birgit Vogtenhuber

An untouchable set in a projective plane is a set of points such that no line of the plane meets the set in exactly one point. Recently, H\'eger and Nagy (Avoiding Secants of Given Size in Finite Projective Planes, J. Combin. Des.…

Combinatorics · Mathematics 2025-05-14 Jeremy M. Dover

In PG(2,32) the following two results are proven by a computer aided search. (i) Uniqueness of hyperfocused 12-arcs, up to projectivities; (ii) Non-existence of hyperfocused 14-arcs. The existence problem for hyperfocused 16-arcs remains…

Combinatorics · Mathematics 2011-02-22 Giorgio Faina , Cristiano Parrettini , Fabio Pasticci

Let $U$ be a $({ k-1 \choose 2}-1)$-dimensional subspace of quadratic forms defined on $\mathrm{PG}(k-1,{\mathbb F})$ with the property that $U$ does not contain any reducible quadratic form. Let $V(U)$ be the points of…

Combinatorics · Mathematics 2020-03-20 Simeon Ball , Valentina Pepe

We study the universal family of odd hyperelliptic curves of genus $g \geq 1$ over $\mathbb{Q}$. We relate the heights of $\mathbb{Q}$-points of Jacobians of curves in this family to the reduction theory of the representation of…

Number Theory · Mathematics 2024-05-17 Jef Laga , Jack A. Thorne

Despite extensive research on distance oracles, there are still large gaps between the best constructions for spanners and distance oracles. Notably, there exist sparse spanners with a multiplicative stretch of $1+\varepsilon$ plus some…

Data Structures and Algorithms · Computer Science 2023-07-24 Davide Bilò , Shiri Chechik , Keerti Choudhary , Sarel Cohen , Tobias Friedrich , Martin Schirneck

This paper gives $n$-dimensional analogues of the Apollonian circle packings in parts I and II. We work in the space $\sM_{\dd}^n$ of all $n$-dimensional oriented Descartes configurations parametrized in a coordinate system,…

Metric Geometry · Mathematics 2007-05-23 R. L. Graham , J. C. Lagarias , C. L. Mallows , A. R. Wilks , C. H. Yan

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…

History and Overview · Mathematics 2025-10-20 MohammadJavad Maarefvand

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…

Computational Geometry · Computer Science 2019-03-08 Boris Aronov , Edward Y. Miller , Micha Sharir

Small complete arcs and caps in Galois spaces over finite fields $\fq$ with characteristic greater than 3 are constructed from cubic curves with an isolated double point. For $m$ a divisor of $q+1$, complete plane arcs of size approximately…

Combinatorics · Mathematics 2013-05-16 Nurdagul Anbar , Daniele Bartoli , Massimo Giulietti , Irene Platoni

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…

Combinatorics · Mathematics 2007-05-23 Ronald Ortner

We establish new lower bounds ex(Q_7,C_4)>=304 and ex(Q_8,C_4)>=680 for the maximum number of edges in a C_4-free subgraph of the 7- and 8-dimensional hypercubes, and give a modern computational reproduction of ex(Q_6,C_4)=132. All bounds…

Combinatorics · Mathematics 2026-05-14 Minamo Minamoto

Over the last two decades, frameworks for distributed-memory parallel computation, such as MapReduce, Hadoop, Spark and Dryad, have gained significant popularity with the growing prevalence of large network datasets. The Massively Parallel…

Data Structures and Algorithms · Computer Science 2022-07-19 Amartya Shankha Biswas , Talya Eden , Quanquan C. Liu , Slobodan Mitrović , Ronitt Rubinfeld

A deformed $q$-calculus is developed on the basis of an algebraic structure involving graded brackets. A number operator and left and right shift operators are constructed for this algebra, and the whole structure is related to the algebra…

High Energy Physics - Theory · Physics 2016-09-06 R. S. Dunne , A. J. Macfarlane , J. A. de Azcárraga , J. C. Pérez Bueno

There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper,…

Information Theory · Computer Science 2021-12-14 Lin Sok
‹ Prev 1 8 9 10 Next ›