相关论文: Non injectivity of the "hair" map
We prove that if a non-singular planar map $\Lambda \in C^2(R^2,R^2)$ has a convex component, then $\Lambda$ is injective. We do not assume strict convexity.
In this paper, we study some relation between the cocenter $\bar H(G)$ of the Hecke algebra $H(G)$ of a connected reductive group $G$ over an nonarchimedean local field and the cocenter $\bar H(M)$ of its Levi subgroups $M$. Given any…
We construct knot invariants on the basis of ascribing Euclidean geometric values to a triangulation of sphere S^3 where the knot lies. The main new feature of this construction compared to the author's earlier papers on manifold invariants…
A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
For any graph $H$, let ${\rm Forb}^*(H)$ be the class of graphs with no induced subdivision of $H$. It was conjectured in [A.D. Scott, Induced trees in graphs of large chromatic number, {\em Journal of Graph Theory}, 24:297--311, 1997]…
We classify all the maximal linklessly embeddable graphs of order 12 and show that their complements are all intrinsically knotted. We derive results about the connected domination numbers of a graph and its complement. We provide an answer…
Jannsen asked whether the rational cycle class map in continuous $\ell$-adic cohomology is injective, in every codimension for all smooth projective varieties over a field of finite type over the prime field. As recently pointed out by…
Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…
We continue to develop the tensor-algebra approach to knot polynomials with the goal to present the story in elementary and comprehensible form. The previously reviewed description of Khovanov cohomologies for the gauge group of rank N-1=1…
It is well known that kernels in graphs are powerful and useful structures, for instance in the theory of games. However, a kernel does not always exist and Chv\'atal proved in 1973 that it is an NP-Complete problem to decide its existence.…
We define numerical link-homotopy invariants of link maps of any number of components, which naturally generalize the Kirk invariant. The Kirk invariant is a link-homotopy invariant of 2-component link maps given by linking numbers of loops…
We provide examples of non-surjective epimorphisms $H\to K$ in the category of Hopf algebras over a field, even with the additional requirement that $K$ have bijective antipode, by showing that the universal map from a Hopf algebra to its…
A vector field X on a manifold M with possibly nonempty boundary is inward if it generates a unique local semiflow $\Phi^X$. A compact relatively open set K in the zero set of X is a block. The Poincar\'e-Hopf index is generalized to an…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
We study the rational Kontsevich integral of torus knots. We construct explicitely a series of diagrams made of circles joined together in a tree-like fashion and colored by some special rational functions. We show that this series codes…
Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid. It is shown that for any finite…
In their celebrated paper [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52], Erd\H{o}s and Hajnal asked the following: is it true, that for any finite graph H there exists a constant c(H) such that for any finite graph G, if G…
For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this…
Paths P1,...,Pk in a graph G=(V,E) are said to be mutually induced if for any 1 <= i < j <= k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test…