Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Duchon, Philippe"'
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states. In this art
Externí odkaz:
http://arxiv.org/abs/2402.06591
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently the space
Externí odkaz:
http://arxiv.org/abs/1812.08525
Publikováno v:
Discrete Applied Mathematics (2013) 1-23
Recent work of Brlek \textit{et al.} gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze their lim
Externí odkaz:
http://arxiv.org/abs/1306.2108
Publikováno v:
N° RR-8241 (2013)
We consider allocation problems that arise in the context of service allocation in Clouds. More specifically, we assume on the one part that each computing resource is associated to a capacity constraint, that can be chosen using Dynamic Voltage and
Externí odkaz:
http://arxiv.org/abs/1302.4414
Autor:
Duchon, Philippe
The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of sampling
Externí odkaz:
http://arxiv.org/abs/1112.5071
Publikováno v:
Theoretical Computer Science 502 (2013) 143-152
In this work, we put to light a formula that relies the number of fully packed loop configurations (FPLs) associated to a given coupling pi to the number of half-turn symmetric FPLs (HTFPLs) of even size whose coupling is a punctured version of the c
Externí odkaz:
http://arxiv.org/abs/1109.0366
Enumeration of alternating sign matrices of even size (quasi-)nvariant under a quarter-turn rotation
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and the number
Externí odkaz:
http://arxiv.org/abs/0910.3047
Publikováno v:
FPSAC'09, Hagenberg : Autriche (2009)
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and the number
Externí odkaz:
http://arxiv.org/abs/0906.3445
Autor:
Duchon, Philippe
We present new conjectures on the distribution of link patterns for fully-packed loop (FPL) configurations that are invariant, or almost invariant, under a quarter turn rotation, extending previous conjectures of Razumov and Stroganov and of de Gier.
Externí odkaz:
http://arxiv.org/abs/0711.2871
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from n states to 2ⁿ states. In this articl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fa11efd8cda0aadc031bacda61f8403