English
Related papers

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

200 papers

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

Combinatorics · Mathematics 2025-10-22 Sofia Brenner , Jean Cardinal , Thomas McConville , Arturo Merino , Torsten Mütze

We consider the problem of discovering subgroup $H$ of permutation group $S_{n}$. Unlike the traditional $H$-invariant networks wherein $H$ is assumed to be known, we present a method to discover the underlying subgroup, given that it…

Machine Learning · Computer Science 2023-09-12 Pavan Karjol , Rohan Kashyap , Prathosh A P

The paper is concerned with directed versions of Posa's theorem and Chvatal's theorem on Hamilton cycles in graphs. We show that for each a>0, every digraph G of sufficiently large order n whose outdegree and indegree sequences d_1^+ \leq…

Combinatorics · Mathematics 2010-02-23 Demetres Christofides , Peter Keevash , Daniela Kühn , Deryk Osthus

We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K\"uhn and Osthus for the 3-uniform case. Though some…

Combinatorics · Mathematics 2015-09-15 Peter Keevash , Daniela Kühn , Richard Mycroft , Deryk Osthus

Let $M$ be a $10$-dimensional closed oriented smooth manifold. Set $$\mathcal{D}_{M} := \{ x \in H^{2}(M; \Z/2) \mid x^{2} + w_{2}(M) x \in \rho_{2} ( TH^{4}(M;\Z) ) \}.$$ Suppose that $H_{1}(M;\Z)=0$ and $\mathcal{D}_{M} \subset \rho_{2}(…

Differential Geometry · Mathematics 2019-08-27 Huijun Yang

We show that M-theory on spaces with irreducible holonomy represent Type IIA backgrounds in which a collection of D6-branes wrap a supersymmetric cycle in a manifold with a holonomy group different from the one appearing in the M-theory…

High Energy Physics - Theory · Physics 2009-11-07 Jaume Gomis

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

Geometric Topology · Mathematics 2017-05-11 Jun Ge , Slavik Jablan , Louis H. Kauffman , Pedro Lopes

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

Combinatorics · Mathematics 2025-02-07 Ron M. Adin , Pál Hegedűs , Yuval Roichman

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(y)\geq 2n-1$ and $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq…

Combinatorics · Mathematics 2012-09-21 S. Kh. Darbinyan , I. A. Karapetyan

We will give a representation-theoretic proof for the multiplication formula in the Ringel-Hall algebra ${\frak H}_\Delta(n)$ of a cyclic quiver $\Delta(n)$ given in \cite[Thm~4.5]{DuFu2015quantum}. As a first application, we see…

Quantum Algebra · Mathematics 2016-08-05 Jie Du , Zhonghua Zhao

Given a variety $Y$ with a rectangular Lefschetz decomposition of its derived category, we consider a degree $n$ cyclic cover $X \to Y$ ramified over a divisor $Z \subset Y$. We construct semiorthogonal decompositions of $\mathrm{D^b}(X)$…

Algebraic Geometry · Mathematics 2018-09-05 Alexander Kuznetsov , Alexander Perry

We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This…

Combinatorics · Mathematics 2011-11-10 Janusz Adamus

In this paper we consider spaces of bivariate splines of bi-degree (m, n) with maximal order of smoothness over domains associated to a two-dimensional grid. We define admissible classes of domains for which suitable combinatorial technique…

Computational Geometry · Computer Science 2021-08-18 Dmitry Berdinsky , Tae-wan Kim , Durkbin Cho , Cesare Bracco , Sutipong Kiatpanichgij

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

Combinatorics · Mathematics 2025-06-30 Jan Kristian Haugland

For a fixed planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal{P}}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In the case when $H$ is a cycle, the asymptotic value of…

Combinatorics · Mathematics 2021-06-08 Christopher Cox , Ryan R. Martin

Let $G_{k,n}$ be the $n$-balanced $k$-partite graph, whose vertex set can be partitioned into $k$ parts, each has $n$ vertices. In this paper, we prove that if $k \geq 2,n \geq 1$, for the edge set $E(G)$ of $G_{k,n}$ $$|E(G)|…

Combinatorics · Mathematics 2023-09-04 Zongyuan Yang , Yi Zhang , Shichang Zhao

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

This paper provides explicit closed formulas in terms of tautological classes for the cycle classes of the height and Artin invariant strata in families of K3 surfaces. The proof is uniform for all strata and uses a flag space as the…

Algebraic Geometry · Mathematics 2015-03-19 Torsten Ekedahl , Gerard van der Geer

In this article we answer a question raised by N. Feldman in \cite{Feldman} concerning the dynamics of tuples of operators on $\mathbb{R}^n$. In particular, we prove that for every positive integer $n\geq 2$ there exist $n$ tuples $(A_1,…

Functional Analysis · Mathematics 2008-03-25 George Costakis , Demetris Hadjiloucas , Antonios Manoussos

Working in univalent foundations, we investigate the symmetries of spheres, i.e., the types of the form $\mathbb{S}^n = \mathbb{S}^n$. The case of the circle has a slick answer: the symmetries of the circle form two copies of the circle.…

Logic in Computer Science · Computer Science 2024-01-29 Pierre Cagne , Ulrik Buchholtz , Nicolai Kraus , Marc Bezem