Displaying similar documents to “Self-Assembly of Icosahedral Viral Capsids: the Combinatorial Analysis Approach”

Universality of slow decorrelation in KPZ growth

Ivan Corwin, Patrik L. Ferrari, Sandrine Péché (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

There has been much success in describing the limiting spatial fluctuations of growth models in the Kardar–Parisi–Zhang (KPZ) universality class. A proper rescaling of time should introduce a non-trivial temporal dimension to these limiting fluctuations. In one-dimension, the KPZ class has the dynamical scaling exponent = 3/2, that means one should find a universal space–time limiting process under the scaling of time as , space like 2/3 and fluctuations like 1/3 as → ∞. In this paper...

Some special solutions of self similar type in MHD, obtained by a separation method of variables

Michel Cessenat, Philippe Genta (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We use a method based on a separation of variables for solving a first order partial differential equations system, using a very simple modelling of MHD. The method consists in introducing three unknown variables , , in addition to the time variable and then in searching a solution which is separated with respect to and only. This is allowed by a very simple relation, called a “metric separation equation”, which...

A note on univoque self-Sturmian numbers

Jean-Paul Allouche (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interval into itself, but it also characterizes univoque real numbers; the other is a disguised version of the set of characteristic Sturmian sequences. As a corollary to our study we obtain that a real number in is univoque and self-Sturmian if and only if the -expansion of is of the form , where is a characteristic...

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [36 (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [40 (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size 8.

Nash equilibria for a model of traffic flow with several groups of drivers

Alberto Bressan, Ke Han (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

Traffic flow is modeled by a conservation law describing the density of cars. It is assumed that each driver chooses his own departure time in order to minimize the sum of a departure and an arrival cost. There are groups of drivers, The -th group consists of drivers, sharing the same departure and arrival costs (), (). For any given population sizes ,, , we prove the existence of a Nash equilibrium solution,...

The number of binary rotation words

A. Frid, D. Jamet (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length . We also give the precise asymptotics for it, which happens to be ( ). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov [39 (1982) 67–84], then independently by Mignosi [82 (1991) 71–84], and others.

Normalization of edit sequences for text synchronization

Rafael C. Carrasco, Alexander Sánchez Díaz (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

It often occurs that local copies of a text are modified by users but that the local modifications are not synchronized (thus allowing the merged text to become the source for later editions) until later when, for instance the network connection is reestablished. Since text editions usually affect a small fraction of the whole content, the history of edit operations provides a compact representation of the modified file. In this paper, we define a normal form for these records...

Normalization of edit sequences for text synchronization

Rafael C. Carrasco, Alexander Sánchez Díaz (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

It often occurs that local copies of a text are modified by users but that the local modifications are not synchronized (thus allowing the merged text to become the source for later editions) until later when, for instance the network connection is reestablished. Since text editions usually affect a small fraction of the whole content, the history of edit operations provides a compact representation of the modified file. In this paper, we define a normal form for these records...

Computing and proving with pivots

Frédéric Meunier (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ =  ...

On the Average Case Complexity of Some P-complete Problems

Maria Serna, Fatos Xhafa (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that some classical P-complete problems can be solved efficiently in NC. The probabilistic model we consider is the sample space of input descriptions of the problem with the underlying distribution being the uniform one. We present parallel algorithms that use a polynomial number of processors and have expected time upper bounded by ( ln 4 + (1))log , asymptotically with high probability, where is the instance size.

Substitution systems associated with the dynamical system (𝒜, )

Maria de Fátima Correia, Carlos Ramos, Sandra Vinagre (2012)

ESAIM: Proceedings

Similarity:

We consider the dynamical system (𝒜, ), where 𝒜 is a class of differential real functions defined on some interval and : 𝒜 → 𝒜 is an operator := , where is a differentiable -modal map. If we consider functions in 𝒜 whose critical values are periodic points for then, we show how to define and characterize a substitution system associated with (𝒜, ...

Integers in number systems with positive and negative quadratic Pisot base

Z. Masáková, T. Vávra (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We consider numeration systems with base and − , for quadratic Pisot numbers and focus on comparing the combinatorial structure of the sets Z and Z of numbers with integer expansion in base , resp. − . Our main result is the comparison of languages of infinite words and coding the ordering of distances between consecutive - and (− )-integers. It turns out that for a class of roots of − − , the languages coincide, while for other...

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the standard normalization-by-evaluation construction for the simply-typed -calculus has a natural counterpart for the untyped -calculus, with the central type-indexed logical relation replaced by a “recursively defined” , in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...

Linear size test sets for certain commutative languages

Štěpán Holub, Juha Kortelainen (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We prove that for each positive integer the finite commutative language = ( ...) possesses a test set of size at most Moreover, it is shown that each test set for has at least -1 elements. The result is then generalized to commutative languages containing a word such that (i) alph() = alph}(); and (ii) each symbol ∈ alph}() occurs at least twice in if it occurs at least twice in some word of : each such possesses...

Encoding FIX in Object Calculi

Roy L. Crole (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the type theory introduced by Crole and Pitts [3] can be encoded in variants of Abadi and Cardelli's object calculi. More precisely, we show that the type theory presented with judgements of both equality and operational reduction can be translated into object calculi, and the translation proved sound. The translations we give can be seen as using object calculi as a metalanguge within which can be represented; an analogy can be drawn with Martin Löf's Theory of Arities...