English
Related papers

Related papers: Filling systems of maximum size

200 papers

Starting with an O(2)-principal fibration over a closed oriented surface F_g, g>=1, a 2-fold covering of the total space is said to be special when the monodromy sends the fiber SO(2) = S^1 to the nontrivial element of Z_2. Adapting D…

Algebraic Topology · Mathematics 2009-04-08 Anne Bauval , Daciberg L Goncalves , Claude Hayat , Maria Herminia de Paula Leite Mello

An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…

Computational Geometry · Computer Science 2021-08-17 Sarah Carmesin , André Schulz

For an algebraic number $\alpha$ we denote by $M(\alpha)$ the Mahler measure of $\alpha$. As $M(\alpha)$ is again an algebraic number (indeed, an algebraic integer), $M(\cdot)$ is a self-map on $\overline{\mathbb{Q}}$, and therefore defines…

Number Theory · Mathematics 2021-05-11 Paul Fili , Lukas Pottmeyer , Mingming Zhang

Let $F_g$ denote the closed orientable surface of genus $g$. What is the least order finite group, $G_g$, for which there is a homomorphism $\psi$ from $\pi_1(F_g)$ to $G_g$ so that no nontrivial simple closed curve on $F_g$ represents an…

Geometric Topology · Mathematics 2010-07-15 Charles Livingston

Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in…

Computational Geometry · Computer Science 2019-04-02 Myroslav Kryven , Alexander Ravsky , Alexander Wolff

Let G be a reductive algebraic group and let H be a reductive subgroup of G. We describe all pairs (G,H) such that for any affine G-variety X with a dense G-orbit isomorphic to G/H the number of G-orbits in X is finite. The maximal number…

Algebraic Geometry · Mathematics 2009-10-03 I. V. Arzhantsev , D. A. Timashev

What is the maximum length ${\rm f}_{\rm max}(\ell, \Sigma)$ of a facial cycle of an inclusion-maximal graph with girth at least $\ell$ embedded on a given surface $\Sigma$? If $\Sigma=\mathcal{P}$ is a plane, we show that $3\ell-11\leq…

Combinatorics · Mathematics 2025-05-20 Maria Axenovich , Leon Kießle , Arsenii Sagdeev , Maksim Zhukovskii

Given two graphs $G$ and $H$, we define $\textsf{v-cover}_{H}(G)$ (resp. $\textsf{e-cover}_{H}(G)$) as the minimum number of vertices (resp. edges) whose removal from $G$ produces a graph without any minor isomorphic to ${H}$. Also…

Data Structures and Algorithms · Computer Science 2017-01-23 Dimitris Chatzidimitriou , Jean-Florent Raymond , Ignasi Sau , Dimitrios M. Thilikos

A finite permutation group $G$ on $\Omega$ is called a rank 3 group if it has precisely three orbits in its induced action on $\Omega \times \Omega$. The largest permutation group on $\Omega$ having the same orbits as $G$ on $\Omega \times…

Group Theory · Mathematics 2022-02-09 Saveliy V. Skresanov

Let $\gamma$ be a filling curve on a topological surface $\Sigma$ of genus $g \geq 2$. The inf invariant of $\gamma$, denoted $m_{\gamma}$, is the infimum of the length function on the space of marked hyperbolic structures on $\Sigma$. This…

Geometric Topology · Mathematics 2025-08-13 Ara Basmajian , Sayantika Mondal

The $2$-closure $\overline{G}$ of a permutation group $G$ on $\Omega$ is defined to be the largest permutation group on $\Omega$, having the same orbits on $\Omega\times\Omega$ as $G$. It is proved that if $G$ is supersolvable, then…

Group Theory · Mathematics 2021-07-06 Ilia Ponomarenko , Andrey Vasil'ev

For a compact surface $ S $ with a finite set of marked points $ P $, we define a 1-system to be a collection of arcs which are pairwise non-homotopic and intersect pairwise at most once. We prove that, up to equivalence, there are exactly…

Geometric Topology · Mathematics 2022-09-13 Denali Relles

We study a particular class of representations from the fundamental groups of punctured spheres $\Sigma_{0,n}$ to the group $\text{PSL} (2,\mathbb R)$ (and their moduli spaces), that we call \emph{super-maximal}. Super-maximal…

Geometric Topology · Mathematics 2016-04-04 Bertrand Deroin , Nicolas Tholozan

Given a bounded domain $\Omega \subset {\Bbb R}^d$ with positive measure and a finite set $A=\{a^1, a^2, \dots, a^d\}$, we say that the set ${\mathcal E}(A)={\{e^{2 \pi i x \cdot a^j}\}}_{a^j \in A}$ is a complete exponential system if for…

Classical Analysis and ODEs · Mathematics 2020-07-17 Alex Iosevich , Azita Mayeli

If M is a closed simple 3-manifold whose fundamental group contains a genus-g surface group for some g>1, and if the dimension of H_1(M;Z_2) is at least max(3g-1,6), we show that M contains a closed, incompressible surface of genus at most…

Geometric Topology · Mathematics 2010-10-20 Marc Culler , Peter B. Shalen

Let $\mathcal{F}$ be a set of finite groups. A finite group $G$ is called an \emph{$\mathcal{F}$-cover} if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. An $\mathcal{F}$-cover is called \emph{minimal} if no proper…

Group Theory · Mathematics 2024-02-20 Peter J. Cameron , David Craven , Hamid Reza Dorbidi , Scott Harper , Benjamin Sambale

A system of simple closed curves on a surface of genus $g$ is said to be sparse if their average pairwise intersection number does not exceed one. We show that the maximal size of a sparse curve systems grows roughly like a function of type…

Geometric Topology · Mathematics 2025-10-17 Sebastian Baader , Jasmin Jörg , Danica Kosanović

Let $p$ be a branched covering of a Riemann surface to the Riemann sphere $\mathbb{P}^1$, with branching set $B \subset \mathbb{P}^1$. We define the complexity of $p$ as infinity, if $\mathbb{P}^1 \setminus B$ does not admit a hyperbolic…

Geometric Topology · Mathematics 2015-04-17 Aldo-Hilario Cruz-Cota

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

Combinatorics · Mathematics 2019-09-09 Selim Bahadır

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

Combinatorics · Mathematics 2017-11-28 Zoltán Lóránt Nagy