31 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR3 papers
- Université Blaise PascalFR3 papers
- Université Clermont AuvergneFR3 papers
- Hohai UniversityCN1 paper
- IkerbasqueES1 paper
- Institut PascalFR1 paper
- Laboratoire de Mathématiques Blaise PascalFR1 paper
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR1 paper
- Laboratoire Microorganismes Génome et EnvironnementFR1 paper
- Middlesex University LondonGB1 paper
- Technion – Israel Institute of TechnologyIL1 paper
- Université Paris DiderotFR1 paper
6 papers
Quantified Constraints and Containment Problems
Barnaby D. Martin, Hubie Chen, Florent R. Madelaine
The quantified constraint satisfaction problem is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifie…
Ultimate resolution of indefinite metamaterial flat lenses
Jessica Bénédicto, Emmanuel Centeno, Rémi Pollès +1
We show that any metallo-dielectric multilayer with a hyperbolic dispersion relation can actually be characterized by a complex effective index. This refractive index, extracted fr…
Well-posedness and long-time behavior of Lipschitz solutions to extremal surface equations
Yue-Jun Peng, Yong-Fu Yang
We show that in one space dimension Lipschitz solutions of extremal surface equations are equivalent to entropy solutions in of a non-strictly hyperbolic system of c…
Tunable Functionality and toxicity studies of Titanium Dioxide Nanotube Layers
E. Feschet-Chassot, V. Raspal, O. K. Awitor +3
In this work, we have developed economic process to elaborate scalable titanium dioxide nanotube layers which show a tunable functionality. The titanium dioxide nanotube layers was…
Fifty Years of the Spectrum Problem: Survey and New Results
Arnaud Durand, Neil Jones, Johann Makowsky +1
In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of…
Universal Structures and the logic of Forbidden Patterns
Florent R. Madelaine
Forbidden Patterns Problems (FPPs) are a proper generalisation of Constraint Satisfaction Problems (CSPs). However, we show that when the input is connected and belongs to a class…