Related papers: A quadratic estimation for the K\"uhnel conjecture…

Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Known results easily imply polynomiality of EMBED(k,2) (k=1,2;…

Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $\theta_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $\theta_1$ is…

By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the…

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds…

Given a nonorientable, locally flatly embedded surface in the $4$-sphere of nonorientable genus $h$, Massey showed that the normal Euler number lies in $\lbrace -2h,-2h+4,\ldots,2h-4,2h \rbrace$. We prove that every such surface with knot…

We prove a version of Whitney's strong embedding theorem for isometric embeddings within the general setting of the Nash-Kuiper h-principle. More precisely, we show that any $n$-dimensional smooth compact manifold admits infinitely many…

Let $\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)}$ and $\mathcal{Q(}% G\mathcal{)}$ be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph $G$, respectively. Denote by $\lambda (\mathcal{T})$ the…

We estimate whether there is an embedding from one n-dimensional rectangle into another which expands every k-dimensional area. Our estimate is sharp up to a constant factor in each dimension.

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…

We present a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a Riemann surface of genus g to…

Let $G$ be a graph with the vertex set $ \lbrace v_1,\ldots,v_n \rbrace$. The Seidel matrix of $G$ is an $n\times n$ matrix whose diagonal entries are zero, $ij$-th entry is $-1$ if $ v_{i} $ and $ v_{j} $ are adjacent and otherwise is $ 1…

On some specified convex supporting sets of spheres, we find a generalized longitude function whose level sets are totally geodesic. Given an arbitrary (weakly) harmonic map into spheres, the composition of the generalized longitude…

This paper studies eigenvalues of some Steklov problems. Among other things, we show the following sharp estimtes. Let $\Omega$ be a bounded smooth domain in an $n(\geq 2)$-dimensional Hadamard manifold an let $0=\lambda_0 < \lambda_1\leq…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…

We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

The quadratic embedding property of graphs consisting of three paths (theta graphs) is fully characterised. For this aim, a theorem by Winkler (1985) is utilized. An alternative proof of that result using the RKHS technique is presented.

Clifford geometric algebras of multivectors are introduced which exhibit a bilinear form which is not necessarily symmetric. Looking at a subset of bi-vectors in CL(K^{2n},B), we proof that theses elements generate the Hecke algebra…