Search results for "combinatorics"
showing 10 items of 1770 documents
WEB 2.0 ET MUSÉES Les nouveaux visages du visiteur
2012
WEB 2.0AND MUSEUMS: THE NEW EACES OF THE VISITOR The increasing integration of techniques from Web 2.0 by the museums illustrates the profound changes that these structures have realized in building their relationship with the audience. The use of these devices, based on a logic of participation, leads to involve the visitor, traditionally rather kept at a distance, on all stages of the implemeritation of the mUseum offered on Internet. Through a careful examinât icin of sites arid features offered by the museal structures, different roles now devolved to the public have been identified. The emergence of these new "faces" of the visitor comes to question, in the longer-term, about the ident…
A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics
2011
International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always comp…
On Prefix Normal Words
2011
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…
Permutations of zero-sumsets in a finite vector space
2020
Abstract In this paper, we consider a finite-dimensional vector space 𝒫 {{\mathcal{P}}} over the Galois field GF ( p ) {\operatorname{GF}(p)} , with p being an odd prime, and the family ℬ k x {{\mathcal{B}}_{k}^{x}} of all k-sets of elements of 𝒫 {\mathcal{P}} summing up to a given element x. The main result of the paper is the characterization, for x = 0 {x=0} , of the permutations of 𝒫 {\mathcal{P}} inducing permutations of ℬ k 0 {{\mathcal{B}}_{k}^{0}} as the invertible linear mappings of the vector space 𝒫 {\mathcal{P}} if p does not divide k, and as the invertible affinities of the affine space 𝒫 {\mathcal{P}} if p divides k. The same question is answered also in the case where …
Functional Information, Biomolecular Messages and Complexity of BioSequences and Structures
2010
In the quest for a mathematical measure able to capture and shed light on the dual notions of information and complexity in biosequences, Hazen et al. have introduced the notion of Functional Information (FI for short). It is also the result of earlier considerations and findings by Szostak and Carothers et al. Based on the experiments by Charoters et al., regarding FI in RNA binding activities, we decided to study the relation existing between FI and classic measures of complexity applied on protein-DNA interactions on a genome-wide scale. Using classic complexity measures, i.e, Shannon entropy and Kolmogorov Complexity as both estimated by data compression, we found that FI applied to pro…
Comment renouveler la stratégie marketing ? Quand le cinéma peut inspirer les stratèges.
2006
Certains succes cinematographiques deviennent de veritables phenomenes de societe. Leur analyse offre de multiples pistes de reflexion concernant de nouvelles options de mise en relation de l'offre avec le marche.
On arithmetic sums of Ahlfors-regular sets
2021
Let $A,B \subset \mathbb{R}$ be closed Ahlfors-regular sets with dimensions $\dim_{\mathrm{H}} A =: \alpha$ and $\dim_{\mathrm{H}} B =: \beta$. I prove that $$\dim_{\mathrm{H}} [A + \theta B] \geq \alpha + \beta \cdot \tfrac{1 - \alpha}{2 - \alpha}$$ for all $\theta \in \mathbb{R} \, \setminus \, E$, where $\dim_{\mathrm{H}} E = 0$.
A posteriori error estimates for time-dependent reaction-diffusion problems based on the Payne-Weinberger inequality
2015
We consider evolutionary reaction-diffusion problem with mixed Dirichlet--Robin boundary conditions. For this class of problems, we derive two-sided estimates of the distance between any function in the admissible energy space and exact solution of the problem. The estimates (majorants and minorants) are explicitly computable and do not contain unknown functions or constants. Moreover, it is proved that the estimates are equivalent to the energy norm of the deviation from the exact solution.
The N-dimensional N-person chesslike game strategy analysis model
2016
In this research a mathematical, symmetric n-player game model, based on chess is designed. Symmetry in this context refers to players' positions with respect to each other. While the order of move naturally violates the symmetry, this problem may also be solved. The motivation for building this kind of game model stems from the difficulty of finding mathematical solutions for multi-player games in general. The number of varying factors is so huge, that finding optimal strategies is mathematically almost impossible. The best way to attempt this is to use simulation. Once the model has been built, it can be applied in many ways by using computational algorithms based on the created model. Ch…
The link of a finitely determined map germ from R 2 to R 2
2010
Let f: (R2, 0) → (R2, 0) be a finitely determined map germ. The link of f is obtained by taking a small enough representative f: U ⊂ R2 → R2 and the intersection of its image with a small enough sphere Sε1 centered at the origin in R2. We will describe the topology of f in terms of the Gauss word associated to its link.