Entity

Time filter

Source Type


Delisle L.,Institute Of Mathematiques Of Jussieu Paris Rive Gauche | Hussin V.,University of Montreal | Zakrzewski W.J.,Durham University
Journal of Physics: Conference Series | Year: 2015

We investigate the geometric characteristics of constant Gaussian curvature surfaces obtained from solutions of the G(m, n) sigma model. Most of these solutions are related to the Veronese sequence. We show that we can distinguish surfaces with the same Gaussian curvature using additional quantities like the topological charge and the mean curvature. The cases of G(1,n) = CPn-1 and G(2,n) are used to illustrate these characteristics. © Published under licence by IOP Publishing Ltd. Source


Michel P.,Institute Of Mathematiques Of Jussieu Paris Rive Gauche | Michel P.,Cergy-Pontoise University
Logical Methods in Computer Science | Year: 2015

By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical challenges. This article takes up the following one: How can a small Turing machine manage to produce very big numbers? It provides the following answer: mostly by simulating Collatz-like functions, that are generalizations of the famous 3x+1 function. These functions, like the 3x+1 function, lead to new unsolved problems in number theory. © 2015 Logical Methods in Computer Science. Source


Delisle L.,Institute Of Mathematiques Of Jussieu Paris Rive Gauche
Journal of Physics A: Mathematical and Theoretical | Year: 2016

We present a characterization of Maurer-Cartan 1-superforms associated to the two-dimensional supersymmetric ℂpN-1 sigma model. We, then, solve the associated linear spectral problem and use its solutions to describe an integrable system for a su(N)-valued map. © 2016 IOP Publishing Ltd. Source


Finkel O.,Institute Of Mathematiques Of Jussieu Paris Rive Gauche | Skrzypczak M.,University of Warsaw
Information Processing Letters | Year: 2014

We show that there are Σ30-complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets. © 2013 Elsevier B.V. Source


Leducq E.,Institute Of Mathematiques Of Jussieu Paris Rive Gauche | Leducq E.,University Paris - Sud
Designs, Codes, and Cryptography | Year: 2015

Jedlicka, Hernando and McGuire proved that Gold and Kasami functions are the only power mappings which are APN on infinitely many extensions of (Formula presented.). For p an odd prime, we prove that the only power mappings (Formula presented.) such that (Formula presented.) which are PN on infinitely many extensions of (Formula presented.) are those such that (Formula presented.), l positive integer. As Jedlicka, Hernando and McGuire, we prove that (Formula presented.) has an absolutely irreducible factor by using Bézout’s theorem. © 2013, Springer Science+Business Media New York. Source

Discover hidden collaborations