English
Related papers

Related papers: On 2-complexes embeddable in 4-space, and the excl…

200 papers

In this paper we present three new families of smooth Type II string theory backgrounds. These are dual to supersymmetry-preserving deformations of 4d SCFTs. The deformations include a VEV for a global current and a `twisted…

High Energy Physics - Theory · Physics 2024-07-30 Dimitrios Chatzis , Ali Fatemiabhari , Carlos Nunez , Peter Weck

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

Combinatorics · Mathematics 2026-05-05 Licheng Zhang , Yuanqiu Huang , Zhangdong Ouyang

In spaces of nonpositive curvature the existence of isometrically embedded flat (hyper)planes is often granted by apparently weaker conditions on large scales. We show that some such results remain valid for metric spaces with non-unique…

Metric Geometry · Mathematics 2016-03-15 Dominic Descombes , Urs Lang

We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [ToC'15] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the…

Computational Complexity · Computer Science 2022-07-04 Jacob Focke , Leslie Ann Goldberg , Marc Roth , Stanislav Živný

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

Combinatorics · Mathematics 2007-05-23 John C. Owen , Stephen C. Power

In this paper, we establish the rationality conjecture raised in \cite{FKS} for any $(r-1)$-connected ($r\geq 2$) $kr$-dimensional CW-complex $X$ ($k\geq 2$) having a unique spherical cohomology class $u\in \tilde{H}^r(X, \mathbb{Z})$ such…

Algebraic Topology · Mathematics 2022-08-24 Azzeddine Boudjaj , Youssef Rami

Concerning the problem of classifying complete submanifolds of Euclidean space with codimension two admitting genuine isometric deformations, until now the only known examples with the maximal possible rank four are the real Kaehler minimal…

Differential Geometry · Mathematics 2018-08-22 M. Dajczer , Th. Vlachos

We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor.

Operator Algebras · Mathematics 2015-09-03 Scott Morrison

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

Combinatorics · Mathematics 2007-05-23 E. Babson , H. Barcelo , M. de Longueville , R. Laubenbacher

For all integers $g \geq 6$ we prove the existence of a metric graph $G$ with $w^1_4=1$ such that $G$ has Clifford index 2 and there is no tropical modification $G'$ of $G$ such that there exists a finite harmonic morphism of degree 2 from…

Algebraic Geometry · Mathematics 2015-01-16 Marc Coppens

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Combinatorics · Mathematics 2026-04-02 Marek Filakovský

We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…

Computational Complexity · Computer Science 2016-03-02 Hubie Chen , Moritz Müller

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Combinatorics · Mathematics 2013-10-02 Keith Mellinger , Ryan Vaughn , Oscar Vega

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…

Computational Geometry · Computer Science 2017-05-09 Radoslav Fulek

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

Combinatorics · Mathematics 2012-10-10 Colin McDiarmid

In 1972, R. Carter introduced admissible diagrams to classify conjugacy classes in a finite Weyl group W. We say that an admissible diagram \Gamma is a Carter diagram if any edge {\alpha, \beta} with inner product (\alpha, \beta) > 0 (resp.…

Representation Theory · Mathematics 2015-03-17 Rafael Stekolshchik

This paper explores a particular statistical model on 6-valent graphs with special properties which turns out to be invariant with respect to certain Roseman moves if the graph is the singular point graph of a diagram of a 2-knot. The…

Mathematical Physics · Physics 2015-10-13 I. G. Korepanov , G. I. Sharygin , D. V. Talalaev

We prove that any compact almost complex manifold $(M, J)$ of real dimension $2m$ admits a pseudo-holomorphic embedding in a Euclidean space of dimension $4m + 2$, endowed with a suitable non-standard almost complex structure. Moreover, we…

Differential Geometry · Mathematics 2016-02-26 Antonio J. Di Scala , Naohiko Kasuya , Daniele Zuddas

We describe a family of 4-dimensional hyperbolic orbifolds, constructed by deforming an infinite volume orbifold obtained from the ideal, hyperbolic 24-cell by removing two walls. This family provides an infinite number of infinitesimally…

Geometric Topology · Mathematics 2014-11-11 Steven P. Kerckhoff , Peter A. Storm

A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…

Combinatorics · Mathematics 2022-09-29 Chun-Hung Liu , David R. Wood
‹ Prev 1 8 9 10 Next ›