English
Related papers

Related papers: 2-semiarcs in $\mathrm{PG}(2,q)$, $q\leq 13$

200 papers

We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically $12^n…

Combinatorics · Mathematics 2009-07-07 Oswin Aichholzer , David Orden , Francisco Santos , Bettina Speckmann

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

Group Theory · Mathematics 2025-02-17 Byung Hee An , Sangrok Oh

A set-theoretic solution to the Pentagon Equation can be described as a \emph{pentagon} algebra $(S, \cdot, \ast)$ such that $(S, \cdot)$ is a semigroup and the operations $\cdot$ and $\ast$ are related by two additional equations. This…

Rings and Algebras · Mathematics 2025-06-18 Marzia Mazzotta , Agata Pilitowska

We classify all the irrational pencils over the surfaces of general type with p=q=2. This classification adds a new evidence to a Catanese conjecture which states that if S has p=q=2 but no irrational pencils then it is the double cover of…

Algebraic Geometry · Mathematics 2007-05-23 F. Zucconi

In the previous works of the authors, a step-by-step algorithm FOP which uses any fixed order of points in the projective plane $\mathrm{PG}(2,q)$ is proposed to construct small complete arcs. In each step, the algorithm adds to a current…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Group Theory · Mathematics 2026-02-02 Andrea Lucchini

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

Combinatorics · Mathematics 2023-05-09 Hajime Tanaka

The differential geometry of almost Grassmann structures defined on a differentiable manifold of dimension n = pq by a fibration of Segre cones SC (p, q) is studied. The peculiarities in the structure of almost Grassmann structures for the…

Differential Geometry · Mathematics 2007-05-23 Maks A. Akivis , Vladislav V. Goldberg

We solve the following geometric problem, which arises in several three-dimensional applications in computational geometry: For which arrangements of two lines and two spheres in R^3 are there infinitely many lines simultaneously…

Algebraic Geometry · Mathematics 2007-05-23 Gábor Megyesi , Frank Sottile , Thorsten Theobald

Minimal 1-saturating sets in the projective plane $PG(2,q)$ are considered. They correspond to covering codes which can be applied to many branches of combinatorics and information theory, as data compression, compression with distortion,…

Combinatorics · Mathematics 2012-03-07 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

A simple consequence of a theorem of Franks says that whenever a continuous map, $g$, is homotopic to angle doubling on the circle it is semiconjugate to it. We show that when this semiconjugacy has one disconnected point inverse, then the…

Dynamical Systems · Mathematics 2007-05-23 Philip Boyland

A bipartite graph on 2n vertices is bipancyclic if it contains cycles of all even lengths from 4 to 2n. In this paper we prove that the random bipartite graph $G(n,n,p)$ with $p(n)\gg n^{-2/3}$ asymptotically almost surely has the following…

Combinatorics · Mathematics 2012-12-17 Yilun Shang

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…

Combinatorics · Mathematics 2020-07-22 Anthony D. Forbes , Terry S. Griggs , Klara Stokes

In this paper, we resolve a conjecture of Green and Liebeck [Disc. Math., 343 (8):117119, 2019] on codes in $PGL(2,q)$. To be specific, we show that: if $D$ is a dihedral subgroup of order $2(q+1)$ in $G=PGL(2,q)$, and $A=\{g\in G: g^{q+1}=…

Combinatorics · Mathematics 2020-09-03 Tao Feng , Weicong Li , Jingkun Zhou

We study smooth tropical plane quartic curves and show that they satisfy certain properties analogous to (but also different from) smooth plane quartics in algebraic geometry. For example, we show that every such curve admits either…

Algebraic Geometry · Mathematics 2021-05-25 Matt Baker , Yoav Len , Ralph Morrison , Nathan Pflueger , Qingchun Ren

In this paper, we first prove that if the edges of $K_{2m}$ are properly colored by $2m-1$ colors in such a way that any two colors induce a 2-factor of which each component is a 4-cycle, then $K_{2m}$ can be decomposed into $m$ isomorphic…

Combinatorics · Mathematics 2016-05-17 Hung-Lin Fu , Yuan-Hsun Lo

Let $p$ denote the characteristic of ${\mathbb F}_q$, the finite field with $q$ elements. We prove that if $q$ is odd then an arc of size $q+2-t$ in the projective plane over ${\mathbb F}_q$, which is not contained in a conic, is contained…

Combinatorics · Mathematics 2018-04-05 Simeon Ball , Michel Lavrauw

We classify all the \emph{$\Delta$-}coherent pairs of measures of the second kind on the real line. We obtain $5$ cases, corresponding to all the families of discrete semiclassical orthogonal polynomials of class $s\leq1.$

Classical Analysis and ODEs · Mathematics 2023-02-06 Diego Dominici , Francisco Marcellán

In Part I, the present authors introduced the notion of a quasi-Galois point, for investigating the automorphism groups of plane curves. In this second part, the number of quasi-Galois points for smooth plane curves is described. In…

Algebraic Geometry · Mathematics 2022-11-30 Satoru Fukasawa , Kei Miura , Takeshi Takahashi

Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole $M$ has dangling edges with one free end, which we call semiedges. Then, every 3-edge-coloring of a multipole induces a coloring…

Combinatorics · Mathematics 2013-08-05 M. A. Fiol , J. Vilaltella