Filters








628 Hits in 2.8 sec

On a conjecture on bidimensional words

Chiara Epifanio, Michel Koskas, Filippo Mignosi
2003 Theoretical Computer Science  
We prove that, given a double sequence w over the alphabet A (i.e. a mapping from Z 2 to A), if there exists a pair (n0; m0) ∈ Z 2 such that pw(n0; m0) ¡ 1 100 n0m0, then w has a periodicity vector, where  ...  In this paper we prove an extension of the Morse-Hedlund theorem to the bidimensional case. On this subject let us state a conjecture (cf.  ...  [27] ), known among the researchers in the ÿeld of Combinatorics on Words as the Nivat's conjecture on bisequences.  ... 
doi:10.1016/s0304-3975(01)00386-3 fatcat:63tdrfolxrbrhob4lokvsjiiza

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)

Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos, Marc Herbstritt
2013 Dagstuhl Reports  
We provide a report on the Dagstuhl Seminar 13121: Bidimensional Structures: Algorithms, Combinatorics and Logic held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013  ...  Then a dynamic programming algorithm for Planar Completion to Bounded Diameter on graphs of bound treewidth would result in the construction of the desired algorithm.  ...  A possible approach is to use the fact that, if (G, k) is a yes instance, then G has treewidth bounded by some function of k.  ... 
doi:10.4230/dagrep.3.3.51 dblp:journals/dagstuhl-reports/DemaineFHT13 fatcat:vbtdm45hovds5eyorghjbz4kr4

Author index

2003 Theoretical Computer Science  
Mignosi, On a conjecture on bidimensional words (1-3) 123-150 Epstein, L. and R. van Stee, Lower bounds for on-line single-machine scheduling (1-3) 439-450 Fernau, H., M. Holzer and R.  ...  esz, Structuring the elementary components of graphs having a perfect internal matching (1-3) 179-210 Buchsbaum, A.L., R. Giancarlo and J.R.  ... 
doi:10.1016/s0304-3975(03)00188-9 fatcat:homaqv6renfnrbiivkw6nrr3xy

Master index

2003 Theoretical Computer Science  
Mignosi, On a conjecture on bidimensional words 299 (1-3) (2003) 123-150 Epstein, L. and R. van Stee, Lower bounds for on-line single-machine scheduling 299 (1-3) (2003) 439-450 Escardo, M., see J.  ...  Ma $ nuch, On the computational complexity of infinite words 295 (1-3) (2003) 141-151 Eades, P., see X. Lin 292 (3) (2003) 679-695 Edmonds, J., J. Gryz, D. Liang and R.J.  ... 
doi:10.1016/s0304-3975(03)00257-3 fatcat:go2i65dmindnlgs66d3bis4ttu

Bidimensionality, Map Graphs, and Grid Minors [article]

Erik D. Demaine, MohammadTaghi Hajiaghayi
2005 arXiv   pre-print
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs.  ...  ., to prove a linear relation between the treewidth of a bounded-genus graph and the treewidth of its dual.  ...  (In other words, we delete all vertices not belonging to one of these paths.) Then we contract every vertex in this union that is not one of thev i,j 's toward its "nearest"v i,j .  ... 
arXiv:cs/0502070v1 fatcat:gjmnub5nobhc5j4e5timmibf64

Recurrence along directions in multidimensional words [article]

Émilie Charlier, Svetlana Puzynina, Élise Vandomme
2020 arXiv   pre-print
In this paper we introduce and study new notions of uniform recurrence in multidimensional words. A d-dimensional word is called uniformly recurrent if for all (s_1,...  ...  We provide several constructions of multidimensional words satisfying this condition, and more generally, a series of four increasingly stronger conditions.  ...  The last author acknowledges partial funding via a Welcome Grant of the Université de Liège.  ... 
arXiv:1907.00192v2 fatcat:ybjhhw6ylbdylmauguiseyqpvu

Escola e instituição

Catarina Pinheiro Mota, Mónica Costa, Paula Mena Matos
2018 Psicologia  
À luz da teoria da vinculação realça-se a importância das ligações seguras entre adultos e jovens.  ...  A ligação aos pares mostra-se relevante corroborando o papel mediador no desenvolvimento do autoconceito.  ...  The present paper proposes a model-based procedure for empirically assessing the appropriateness of the conjectures described above, and, more generally, for assessing the impact of AR on FC items.  ... 
doi:10.17575/rpsicol.v32i1.1277 fatcat:2c3xrplr3jcwfhjc7wbhaz6dsi

On local diffeomorphisms ofR n that are injective

Alexandre Fernandes, Carlos Gutierrez, Roland Rabanal
2004 Qualitative Theory of Dynamical Systems  
Let X : R 2 → R 2 be a map of class C 1 and let Spec(X) be the set of (complex) eigenvalues of the derivative DXp when p varies in R 2 .  ...  in a stronger way, the Chamberland Conjecture in dimension 2. (4) This theorem does not imply the bidimensional real Keller Jacobian Conjecture, since given an even natural n, the polynomial map X(x, y  ...  As a consequence, Theorem 2.1 together with Olech's work [13] provide an alternative and short proof of the bidimensional Marcus-Yamabe Conjecture ( [11] , [6] , [7] ). (3) This theorem confirms,  ... 
doi:10.1007/bf02970861 fatcat:bmycvjpyszh3dmk3olcgthgfzy

Page 2432 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
Jean-Paul Allouche (Orsay) 2004c:68116 68R15 Epifanio, Chiara (I-PLRM-AM; Palermo); Koskas, Michel (F-PCRDM; Amiens) ; Mignosi, Filippo (I-PLRM-AM; Palermo) On a conjecture on bidimensional words.  ...  Among other results, one states that given a semiperiodic word w, a word v has the same set of factors of length 1+ R,, of w iff v is semiperiodic and the roots of v, w are conjugate (the root of a word  ... 

Attractors for return maps near homoclinic tangencies of three-dimensional dissipative diffeomorphisms

Antonio Pumariño, Joan Tatjer
2007 Discrete and continuous dynamical systems. Series B  
We think that the right approach to give a positive answer to the above conjecture would be to prove the following one: Conjecture 2.  ...  One of them (the one displaying a bidimensional structure) is the continuation of the attractor described in Figure 7f) and therefore is one of the pieces of an 8-pieces bidimensional attractor.  ... 
doi:10.3934/dcdsb.2007.8.971 fatcat:lqnnpajflnbunehb75arxxbrce

Bidimensionality and Kernels [article]

Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Dimitrios M. Thilikos
2020 arXiv   pre-print
Our results imply that a multitude of bidimensional problems g graph classes. For most of these problems no polynomial kernels on H-minor-free graphs were known prior to our work.  ...  ACM, 52 (2005), pp.866--893] as a tool to obtain sub-exponential time parameterized algorithms on H-minor-free graphs. In [E.D.  ...  We also set c = OP T Π (G 2 ) − OP T Π (G 1 ) (notice that c depends only on G 1 and G 2 ).  ... 
arXiv:1606.05689v3 fatcat:472cpmaxlfailcqrtajs32sl5i

Page 3111 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
This paper in- troduces the following new results concerning syntenic distance: Using a direct proof, we solve a conjecture by D.  ...  The result is then generalized to what we call bidimensional syntenic diameter.  ... 

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths [article]

Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2020 arXiv   pre-print
, G and H on n and k vertices, respectively, determine whether G contains H as a minor).  ...  In this semi-survey, we will first give an exposition of the Graph Minors Theory with emphasis on efficiency from the viewpoint of Parameterized Complexity.  ...  In perhaps one of the most amazing feats of modern mathematics, Robertson and Seymour managed to prove Wagner's conjecture.  ... 
arXiv:2008.08373v1 fatcat:6r5lrs44nnegrcde6iakechrei

Flowing along the edge: Spinning up black holes in AdS spacetimes with test particles

Jorge V. Rocha, Raphael Santarelli
2014 Physical Review D  
This process allows us to test the generalization of the weak cosmic censorship conjecture to asymptotically AdS spacetimes in higher dimensions.  ...  Instead, test particles carrying the maximum possible angular momentum that still fall into an extremal rotating black hole generate a flow along the curve of extremal solutions.  ...  Acknowledgements It is a pleasure to thank Antonino Flachi and Vincenzo Vitagliano for comments and a careful reading of a draft.  ... 
doi:10.1103/physrevd.89.064065 fatcat:gd57ox2ldfhxloviy5pttmclme

Graph Minors and Parameterized Algorithm Design [chapter]

Dimitrios M. Thilikos
2012 Lecture Notes in Computer Science  
The Graph Minors Theory, developed by Robertson and Seymour, has been one of the most influential mathematical theories in parameterized algorithm design.  ...  We discuss its direct meta-algorithmic consequences, we present the algorithmic applications of core theorems such as the grid-exclusion theorem, and we give a brief description of the irrelevant vertex  ...  Kolliopoulos for their detailed comments, remarks, and suggestions on this text. We also wish to personally thank Michael R.  ... 
doi:10.1007/978-3-642-30891-8_13 fatcat:56shhf7tevfdpczn4m7qir3zti
« Previous Showing results 1 — 15 out of 628 results