English
Related papers

Related papers: 2-complexes with large 2-girth

200 papers

We show that every $k$-uniform hypergraph on $n$ vertices whose minimum $(k-2)$-degree is at least $(5/9+o(1))n^2/2$ contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The…

Combinatorics · Mathematics 2022-07-08 Joanna Polcyn , Christian Reiher , Vojtěch Rödl , Bjarne Schülke

We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.

We show that determining if an $n$-vertex graph has twin-width at most 4 is NP-complete, and requires time $2^{\Omega(n/\log n)}$ unless the Exponential-Time Hypothesis fails. Along the way, we give an elementary proof that $n$-vertex…

Computational Complexity · Computer Science 2021-12-17 Pierre Bergé , Édouard Bonnet , Hugues Déprés

We investigate the ``generalized Heron polynomial'' that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths. For a (2m+1)-gon or (2m+2)-gon, we express it as the defining polynomial of a certain…

Metric Geometry · Mathematics 2007-05-23 F. Miller Maley , David P. Robbins , Julie Roskies

The number of nonisomorphic simplicial complexes with up to $n$ vertices increases super-exponentially with $n$, which makes exhaustive computation of invariants associated with such complexes a daunting task. In this paper we provide a…

Algebraic Topology · Mathematics 2025-11-05 Dejan Govc , Wacław Marzantowicz , Łukasz Patryk Michalak , Petar Pavešić

We construct a collection of higher Chow cycles on certain surfaces which degenerate to an arrangement of planes in general position. When its degree is 4, this construction gives a new explicit proof of the Hodge-D-Conjecture for a certain…

Algebraic Geometry · Mathematics 2021-06-08 Tokio Sasaki

Let $q$ be a non-degenerate quadratic form defined on an $F$ vector space $V$ and $a \in F$. We consider the Cayley graph on $V$ with generating set $\{x \in V \mid q(x) = a\}$ and study its diameter and girth. In particular, if $F$ is a…

Number Theory · Mathematics 2025-03-04 Nico Lorenz , Marc Christian Zimmermann

Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…

Computational Geometry · Computer Science 2021-06-15 Saeed Asaeedi , Farzad Didehvar , Ali Mohades

We consider the problem of computing the second elementary symmetric polynomial S^2_n(X) using depth-three arithmetic circuits of the form "sum of products of linear forms". We consider this problem over several fields and determine EXACTLY…

Discrete Mathematics · Computer Science 2007-05-23 Jaikumar Radhakrishnan , Pranab Sen , Sundar Vishwanathan

In this paper we study the cyclicity of sliding cycles for regularized piecewise smooth visible-invisible two-folds, in the presence of singularities of the Filippov sliding vector field located away from two-folds. We obtain a slow-fast…

Dynamical Systems · Mathematics 2025-03-14 Jicai Huang , Renato Huzak , Otavio Henrique Perez , Jinhui Yao

For a complex surface of general type with a relatively minimal genus 2 fibration, the bounds of the orders of the automorphism group of the fibration, of its abelian subgroups and of its cyclic subgroups are determined as linear functions…

alg-geom · Mathematics 2008-02-03 Zhi-Jie Chen

We prove that the number of vertices of a polytope of a particular kind is exponentially large in the dimension of the polytope. As a corollary, we prove that an n-dimensional centrally symmetric polytope with O(n) facets has 2^{Omega(n)}…

Combinatorics · Mathematics 2012-04-24 Alexander Barvinok

The $4$-girth-thickness $\theta(4,G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least four whose union is $G$. In this paper, we obtain that the 4-girth-thickness of complete tripartite graph $K_{n,n,n}$ is…

Combinatorics · Mathematics 2020-10-13 Xia Guo , Yan Yang

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

Combinatorics · Mathematics 2022-12-06 Jie Ma , Tianchi Yang

In this article we study the endomorphism algebras of abelian varieties $A$ defined over a given number field $K$ with large cyclic 2-torsion fields. A key step in doing so is to provide criteria for all the endomorphisms of $A$ to be…

Number Theory · Mathematics 2026-03-24 Pip Goodman

We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…

Combinatorics · Mathematics 2025-06-13 On-Hei Solomon Lo , Carol T. Zamfirescu

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…

Combinatorics · Mathematics 2012-08-14 Michael D. Barrus

Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…

Algebraic Geometry · Mathematics 2026-05-25 Juan García Escudero

The most commonly encountered types of complex analytic G-structures and Cartan geometries cannot have singularities of complex codimension 2 or more.

Differential Geometry · Mathematics 2009-06-08 Benjamin McKay

Generic bifurcation theory was classically well developed for smooth differential systems, establishing results for $k$-parameter families of planar vector fields. In the present study we focus on a qualitative analysis of $2$-parameter…

Dynamical Systems · Mathematics 2018-09-11 Douglas Duarte Novaes , Marco Antonio Teixeira , Iris de Oliveira Zeli