English
Related papers

Related papers: Regular self-dual and self-Petrie-dual maps of arb…

200 papers

We bound the second eigenvalue of random $d$-regular graphs, for a wide range of degrees $d$, using a novel approach based on Fourier analysis. Let $G_{n, d}$ be a uniform random $d$-regular graph on $n$ vertices, and let $\lambda (G_{n,…

Combinatorics · Mathematics 2022-12-06 Amir Sarid

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified

Combinatorics · Mathematics 2021-08-11 Mohsen Ghasemi , Rezvan Varmazyar

We prove that for every relatively prime pair of integers $(d,r)$ with $r>0$, there exists an exceptional pair $({\mathcal O},V)$ on any del Pezzo surface of degree 4, such that $V$ is a bundle of rank $r$ and degree $d$. As an application,…

Algebraic Geometry · Mathematics 2026-01-21 Alexander Polishchuk , Eric Rains

A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…

Combinatorics · Mathematics 2023-02-06 Ishay Haviv , Michal Parnas

We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…

Geometric Topology · Mathematics 2023-08-21 Andrew Bartholomew , Roger Fenn

For each even, positive integer $n$, we define a rational self-map on the space of plane curves of degree $n$, using classical contravariants. In the case of plane quartics, we show that the degree of this map is 15. This answers a question…

Algebraic Geometry · Mathematics 2018-07-10 Marco Pacini , Damiano Testa

We contribute results on $r$-regular graphs that do and don't have the maximum possible toughness, namely $r/2$. Doty and Ferland showed the existence of a $5$-regular graph with toughness $5/2$ for all even orders except $n= 18$. Using a…

Combinatorics · Mathematics 2025-05-09 Geoffrey Boyer , Wayne Goddard

We study the Betti map of a particular (but relevant) section of the family of Jacobians of hyperelliptic curves using the polynomial Pell equation $A^2-DB^2=1$, with $A,B,D\in \mathbb C[t]$ and certain ramified covers ${\mathbb P}^1\to…

Number Theory · Mathematics 2021-10-13 Fabrizio Barroero , Laura Capuano , Umberto Zannier

This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…

Number Theory · Mathematics 2018-10-04 Jason A. C. Gallas

In order to study signed Eulerian numbers, we introduce permutations of a particular type, called parity-alternate permutations, because they take even and odd entries alternately. The objective of this paper is twofold. The first is to…

Combinatorics · Mathematics 2007-05-23 Shinji Tanimoto

In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…

Number Theory · Mathematics 2026-03-18 Caleb McKinley Shor

A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…

Combinatorics · Mathematics 2015-01-15 R. H. Eggermont , M. Hendriks

Dom de Caen posed the question whether connected graphs with three distinct eigenvalues have at most three distinct valencies. We do not answer this question, but instead construct connected graphs with four and five distinct eigenvalues…

Combinatorics · Mathematics 2015-05-08 Edwin R. van Dam , Jack H. Koolen , Zheng-jiang Xia

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

Dynamical Systems · Mathematics 2020-08-12 el Houcein el Abdalaoui

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

Complex Variables · Mathematics 2025-05-22 Ilia Binder , David Pechersky

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D$ and valency $k \ge 3$. In [Homotopy in $Q$-polynomial distance-regular graphs, Discrete Math., {\bf 223} (2000), 189-206], H. Lewis showed that the girth of…

Combinatorics · Mathematics 2025-01-27 Štefko Miklavič

In this article, we study orientably-regular maps of Euler characteristic $-2p^2$ and classify those that admit a group of orientation-preserving automorphisms of order $10p^2$, where $p$ is a prime number. Along the way, we classify all…

Combinatorics · Mathematics 2026-04-06 Tomás Foncea E. , Sebastián Reyes-Carocca

We show that the local equivalence problem for second-order ordinary differential equations under point transformations is completely characterized by differential invariants of order at most 10 and that this upper bound is sharp. We also…

Differential Geometry · Mathematics 2014-05-28 Robert Milson , Francis Valiquette

Complex Hermitian random matrices with a unitary symmetry can be distinguished by a weight function. When this is even, it is a known result that the distribution of the singular values can be decomposed as the superposition of two…

Probability · Mathematics 2015-03-26 Folkmar Bornemann , Peter J. Forrester

For a prime power $q$, let $ER_q$ denote the Erd\H{o}s-R\'enyi orthogonal polarity graph. We prove that if $q$ is an even power of an odd prime, then $\chi ( ER_{q}) \leq 2 \sqrt{q} + O ( \sqrt{q} / \log q)$. This upper bound is best…

Combinatorics · Mathematics 2014-09-16 Xing Peng , Mike Tait , Craig Timmons