English
Related papers

Related papers: Two-dimensional cycle classes on $\overline{\mathc…

200 papers

Let $n\geq k\geq r+3$ and $\mathcal H$ be an $n$-vertex $r$-uniform hypergraph. We show that if $|\mathcal H|> \frac{n-1}{k-2}\binom{k-1}{r}$ then $\mathcal H$ contains a Berge cycle of length at least $k$. This bound is tight when $k-2$…

Combinatorics · Mathematics 2018-05-15 Zoltan Furedi , Alexandr Kostochka , Ruth Luo

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

Information Theory · Computer Science 2017-09-19 Minjia Shi , Zhongyi Zhang , Patrick Sole

Fulton's question about effective $k$-cycles on $\overline{M}_{0,n}$ for $1<k<n-4$ can be answered negatively by appropriately lifting to $\overline{M}_{0,n}$ the Keel-Vermeire divisors on $\overline{M}_{0,k+1}$. In this paper we focus on…

Algebraic Geometry · Mathematics 2015-09-04 Luca Schaffler

A heterodimensional cycle consists of a pair of heteroclinic connections between two saddle periodic orbits with unstable manifolds of different dimensions. Recent theoretical work on chaotic dynamics beyond the uniformly hyperbolic setting…

Dynamical Systems · Mathematics 2019-06-28 Andy Hammerlindl , Bernd Krauskopf , Gemma Mason , Hinke M. Osinga

Here we study some algebraic properties of non-cyclic graphs. In this paper we show that $\overline{\Gamma}_G$ is isomorphic to $K_3\cup (n-4)K_1$ or $K_4\cup (n-5)K_1$ if and only if $G$ is isomorphic to $D_8$ or $D_{10}$, respectively. We…

Group Theory · Mathematics 2017-01-11 Ebrahim Vatandoost , Yasser Golkhandy Pour

The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is $O(n^3)$.

Data Structures and Algorithms · Computer Science 2007-06-20 Guohun Zhu

We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…

Combinatorics · Mathematics 2019-07-19 Rogers Mathew , Ilan Newman , Yuri Rabinovich , Deepak Rajendraprasad

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…

Combinatorics · Mathematics 2025-02-03 Jiří Fink , Vojtěch Hotmar

Functional bases of second-order differential invariants of the Euclid, Poincar\'e, Galilei, conformal, and projective algebras are constructed. The results obtained allow us to describe new classes of nonlinear many-dimensional invariant…

Mathematical Physics · Physics 2007-05-23 W. I. Fushchych , Irina Yehorchenko

Consider the smooth quadric Q_6 in P^7. The middle homology group H_6(Q_6,Z) is two-dimensional with a basis given by two classes of linear subspaces. We classify all threefolds of bidegree (1,p) inside Q_6.

Algebraic Geometry · Mathematics 2008-08-13 Lev Borisov , Jeff Viaclovsky

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

Combinatorics · Mathematics 2024-03-05 Oswin Aichholzer , Joachim Orthaber , Birgit Vogtenhuber

We study universal families of stable genus two curves with level structure. Among other things, it is shown that the (1,1) part is spanned by divisor classes, and that there are no cycles of type (2,2) in the third cohomology of the first…

Algebraic Geometry · Mathematics 2019-03-06 Donu Arapura

We say that a k-uniform hypergraph C is an l-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of…

Combinatorics · Mathematics 2013-08-15 Daniela Kühn , Richard Mycroft , Deryk Osthus

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

Algebraic Topology · Mathematics 2017-07-11 Dominic Dotterrer , Larry Guth , Matthew Kahle

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Combinatorics · Mathematics 2016-04-01 Francesca Merola , Tommaso Traetta

A heterodimensional cycle is an invariant set of a dynamical system consisting of two hyperbolic periodic orbits with different dimensions of their unstable manifolds and a pair of orbits that connect them. For systems which are at least…

Dynamical Systems · Mathematics 2024-04-11 Dongchen Li , Dmitry Turaev

We conclude the construction of the algebraic complex, consisting of spaces of differentials of Euclidean metric values, for four-dimensional piecewise-linear manifolds. Assuming that the complex is acyclic, we investigate how its torsion…

Geometric Topology · Mathematics 2019-08-21 Igor G. Korepanov

In this paper we investigate the form of calibrated M5-branes in the presence of a nonvanishing 3-form field H. We discuss the influence of the H-field on the deformation of supersymmetric n-cycles (in particular SLAG submanifolds in R^n).…

High Energy Physics - Theory · Physics 2009-10-07 D. Lust , A. Miemiec

Building of some isomorphic classes for noncanonical hypercomplex number systems o dimension 2 is described. In general case, such systems with specific constraints to structural constants can be isomorphic to complex, dual or double number…

Numerical Analysis · Computer Science 2014-03-11 Yakiv O. Kalinovsky , Dmitry V. Lande , Yuliya E. Boyarinova , Iana V. Khitsko

We say a graph $H$ decomposes a graph $G$ if there exists a partition of the edges of $G$ into subgraphs isomorphic to $H$. We seek to characterize necessary and sufficient conditions for a cycle of length $k$, denoted $C_k$, to decompose…

Combinatorics · Mathematics 2023-10-23 Moriah Aberle , Sarah Gold , Rivkah Moshe , David Offner