embeddability condition
Recently Published Documents


TOTAL DOCUMENTS

3
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2014 ◽  
Vol 23 (07) ◽  
pp. 1460004
Author(s):  
Tyler Friesen ◽  
Vassily Olegovich Manturov

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper [Embeddings of *-graphs into 2-surfaces, preprint (2012), arXiv:1212.5646] by the authors, the problem of calculating whether a given *-graph in which all vertices have degree 4 or 6 admits a ℤ2-homologically trivial embedding into a given orientable surface was shown to be equivalent to a problem on matrices. Here we extend those results to nonorientable surfaces. The embeddability condition that we obtain yields quadratic-time algorithms to determine whether a *-graph with all vertices of degree 4 or 6 admits a ℤ2-homologically trivial embedding into the projective plane or into the Klein bottle.



1998 ◽  
Vol 14 (6) ◽  
pp. 744-769 ◽  
Author(s):  
Jean-Pierre Florens ◽  
Eric Renault ◽  
Nizar Touzi

Given an observation of a discrete-time process {Yi,i = 0...n} assumed to be Markov, stationary, and time reversible, we develop a (conservative) test procedure of embeddability by a continuous-time reversible Markov process. The test statistic is derived from a set of moment inequality restrictions implied by the spectral properties of such continuous-time processes. Most interesting is that the embeddability condition of interest is a direct extension of the well-known embeddability problem by a two-state Markov chain. Empirical experiments show that the embeddability hypothesis is rejected more frequently for exchange rate daily data than for stock indices data.



1989 ◽  
Vol 54 (3) ◽  
pp. 735-760 ◽  
Author(s):  
K. Ambos-Spies ◽  
M. Lerman

The problem of characterizing the finite lattices which can be embedded into the recursively enumerable degrees has a long history, which is summarized in [AL]. This problem is an important one, as its solution is necessary if a decision procedure for the ∀∃-theory of the poset of recursively emumerable degrees is to be found. A recursive nonembeddability condition, NEC, which subsumes all known nonembeddability conditions was presented in [AL]. This paper focuses on embeddability. An embeddability condition, EC, is introduced, and we prove that every finite lattice having EC can be embedded (as a lattice) into . EC subsumes all known embeddability conditions.EC is a Π3 condition which states that certain obstructions to proving embeddability do not exist. It seems likely that the recursive labeled trees used in EC can be replaced with trees which are effectively generated from uniformly defined finite trees, in which case EC would be equivalent to a recursive condition. We do not know whether EC and NEC are complementary. This problem seems to be combinatorial, rather than recursion-theoretic in nature. Our efforts to find a finite lattice satisfying neither EC nor NEC have, to this point, been unsuccessful. It is the second author's conjecture that the techniques for proving embeddability which are used in this paper cannot be refined very much to obtain new embeddability results.EC is introduced in §2, and the various conditions and definitions are motivated by presenting examples of embeddable lattices and indicating how the embedding proof works in those particular cases. The embedding construction is presented in §3, and the proof in §4.



Sign in / Sign up

Export Citation Format

Share Document