English
Related papers

Related papers: Converses to generalized Conway--Gordon type congr…

200 papers

The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We…

Group Theory · Mathematics 2025-10-15 Victor Buchstaber , Mikhail Kornev

Let $G_{n,k}$ denote the real Grassmann manifold of $k$-dimensional vector subspaces of $\mathbb R^n$. Using the Hodgkin spectral sequence, we compute the complex $K$-ring of $G_{n,k}$, up to a small indeterminacy, for all values of $n,k$…

K-Theory and Homology · Mathematics 2022-12-14 Sudeep Podder , Parameswaran Sankaran

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Combinatorics · Mathematics 2025-02-26 Robert R. Petro , Connor M. Phillips

We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices. We consider the subclass of these graphs for which each pair of…

Combinatorics · Mathematics 2023-09-12 Carmen Amarra , Wei Jin , Cheryl E. Praeger

By utilizing the recently developed hypergraph analogue of Godsil's identity by the second author, we prove that for all $n \geq k \geq 2$, one can reconstruct the matching polynomial of an $n$-vertex $k$-uniform hypergraph from the…

Combinatorics · Mathematics 2025-02-03 Donggyu Kim , Hyunwoo Lee

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…

Combinatorics · Mathematics 2007-05-23 Bhalchandra D. Thatte

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…

Combinatorics · Mathematics 2012-02-28 Guillaume Chapuy , Valentin Féray

We introduce a family of generalized Schr\"oder polynomials $S_\tau(q,t,a)$, indexed by triangular partitions $\tau$ and prove that $S_\tau(q,t,a)$ agrees with the Poincar\'e series of the triply graded Khovanov-Rozansky homology of the…

Geometric Topology · Mathematics 2024-07-26 Carmen Caprau , Nicolle González , Matthew Hogancamp , Mikhail Mazin

We give a uniform and self-contained proof that if $G$ is a connected graph with $\chi(G) = \Delta(G)$ and $G\neq \overline{C_7}$, then $G$ contains either $K_{\Delta(G)}$ or an odd hole where every vertex has degree at least $\Delta(G)-1$…

Combinatorics · Mathematics 2025-08-14 Rachel Galindo , Jessica McDonald , Songling Shan

Recently the long-standing puzzle about counting the Witten index in N=1 supersymmetric gauge theories was resolved. The resolution was based on existence (for higher orthogonal $SO(N), N \geq 7$ and exceptional gauge groups) of flat…

High Energy Physics - Theory · Physics 2015-06-26 K. G. Selivanov

We prove the "Sullivan Conjecture" on the classification of 4-dimensional complete intersections up to diffeomorphism. Here an $n$-dimensional complete intersection is a smooth complex variety formed by the transverse intersection of $k$…

Geometric Topology · Mathematics 2025-02-11 Diarmuid Crowley , Csaba Nagy

A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from…

Combinatorics · Mathematics 2021-09-06 Jacob David , Pierce Lai , SuHo Oh , Christopher Wu

We say a red/blue edge-coloring of the $n$-dimensional cube graph, $Q_n$, is antipodal if all pairs of antipodal edges have different colors. Norine conjectured that in such a coloring there must exist a pair of antipodal vertices connected…

Combinatorics · Mathematics 2024-08-06 Keith Frankston , Danny Scheinerman

This paper examines the issues involved with concretely implementing a sum over conifolds in the formulation of Euclidean sums over histories for gravity. The first step in precisely formulating any sum over topological spaces is that one…

General Relativity and Quantum Cosmology · Physics 2009-10-22 Kristin Schleich , Donald M. Witt

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

Combinatorics · Mathematics 2026-03-13 Haiyang Liu , Bo Ning

A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer $n\ge 9,$ there exists a homogeneously traceable nonhamiltonian graph of order…

Combinatorics · Mathematics 2021-12-07 Yanan Hu , Xingzhi Zhan

Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…

High Energy Physics - Theory · Physics 2015-08-31 A. Mironov , A. Morozov

In this paper we prove a generalized version of Hall's theorem for hypergraphs. More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1,…

Combinatorics · Mathematics 2016-10-04 Reza Jafarpour-Golzari

A conjecture of Mumford predicts a complete set of relations between the generators of the cohomology ring of the moduli space of rank 2 semi-stable sheaves with fixed odd degree determinant on a smooth, projective curve of genus at least…

Algebraic Geometry · Mathematics 2021-03-18 Ananyo Dan , Inder Kaur

We show that, given any $n$ and $\alpha$, every embedding of any sufficiently large complete graph in $\mathbb{R}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such that for every $i\not =j$, $|\lk(Q_i,Q_j)|\geq\alpha$ and…

Geometric Topology · Mathematics 2009-01-18 Erica Flapan , Blake Mellor , Ramin Naimi