Related papers: Packing A-Paths of Length Zero Modulo Four

Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa…

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…

We prove that every complete metric space with property (Z) is a length space. These answers questions posed by Garc\'{i}a-Lirola, Proch\'{a}zka and Rueda Zoca, and by Becerra Guerrero, L\'{o}pez-P\'{e}rez and Rueda Zoca, related to the…

The existence of an extremal code of length 72 is a long-standing open problem. Let C be a putative extremal code of length 72 and suppose that C has an automorphism g of order 6. We show that C, as an F_2<g>-module, is the direct sum of…

In this paper we address the postulation problem of zero-dimensional schemes on a surface of length at most 4. We prove some general results and then we focus on the case of P2, P1xP1 and Hirzebruch surfarces. In particular, we prove that…

Ihara's proof that the reduction of the modular curve $X_0(n)$ at a prime $p$ not dividing $n$ has many points over a quadratic extension is adapted to the drinfeld modular curves $X_0(n)$. In order to do so, some properties of drinfeld…

Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…

In this note, we prove the existence of a limiting distribution of the free path lengths on flat surfaces with circular obstacles as the radius of the obstacles goes to zero. Moreover, we relate this distribution to the distribution of the…

In 1980, Paul Erd\H{o}s posed the following problem: For every positive integer $n,$ determine a nonhamiltonian graph of order $n$ having the maximum number of Hamilton paths. We solve the more general problem of determining the…

We consider the relative group presentation $\mathcal{P} = \langle G, \mathbf{x} | \mathbf{r} \rangle$ where $\mathbf{x} = \{ x \}$ and $\mathbf{r} = \{ xg_1 xg_2 xg_3 x^{-1} g_4 \}$. We show modulo a small number of exceptional cases…

Let $M$ be a topological spherical space form, i.e. a smooth manifold whose universal cover is a homotopy sphere. We determine the number of path components of the space and moduli space of Riemannian metrics with positive scalar curvature…

Let $\gamma: I \to S^2$ be a $C^2$ curve with $\det(\gamma, \gamma', \gamma'')$ nonvanishing, and for each $\theta \in I$ let $\rho_{\theta}$ be orthogonal projection onto the span of $\gamma(\theta)$. It is shown that if $A \subseteq…

In this paper, we prove a form of purity property for the $(\mathbb{P}^1, \infty)$-invariant replacement $h_0^{\overline{\square}}(\mathfrak{X})$ of the Yoneda object $\mathbb{Z}_{\rm tr} (\mathfrak{X})$ for a modulus pair…

It is well known that the Euler characteristic of an odd dimensional compact manifold is zero. An Euler complex is a combinatorial analogue of a compact manifold. We present here an elementary proof of the corresponding result for Euler…

Let R be a ring (associative, with 1). A non-zero module M is said to be a Pruefer module provided there exists a surjective, locally nilpotent endomorphism with kernel of finite length. The aim of this note is construct Pruefer modules…

We construct local Arthur packets associated with a dihedral long root $A$-parameter of a split reductive group of type $G_2$ over a nonarchimedian local field of characteristic zero. The construction relies on an exceptional correspondence…

Erd\H{o}s and Gy\'arf\'as conjectured in 1994 that every graph with minimum degree at least 3 has a cycle of length a power of 2. In 2022, Gao and Shan (Graphs and Combinatorics) proved that the conjecture is true for $P_8$-free graphs,…

A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…

Let $P_{10}$ be a path on $10$ vertices. A graph is said to be $P_{10}$-free if it does not contain $P_{10}$ as an induced subgraph. The well-known Erd\H{o}s-Gy\'{a}rf\'{a}s Conjecture states that every graph with minimum degree at least…

It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.