Search results for "Modulo"

Measuring the clustering effect of BWT via RLE

2017

Abstract The Burrows–Wheeler Transform (BWT) is a reversible transformation on which are based several text compressors and many other tools used in Bioinformatics and Computational Biology. The BWT is not actually a compressor, but a transformation that performs a context-dependent permutation of the letters of the input text that often create runs of equal letters (clusters) longer than the ones in the original text, usually referred to as the “clustering effect” of BWT. In particular, from a combinatorial point of view, great attention has been given to the case in which the BWT produces the fewest number of clusters (cf. [5] , [16] , [21] , [23] ). In this paper we are concerned about t…

Cimo: An efficient 2-phases calculator of multimodal itineraries for real trans-territories based on a dynamic programming

2015

In this work we propose an exact solution for calculating multimodal itinerary. This solution is named Cimo (Calculateur d'Itineraires Multimodaux Ordonnes). Cimo is an exact optimal itineraries' calculator wherein itineraries are sorted, multimodal, and trans-territorial. The solution is based on a dynamic programming algorithm "cut", "price" and "share". This solution is multi-objectives and multi-constraints. Several versions of this algorithm are proposed following a methodological approach that enables evaluation of efficiency and complexity's gain : through theoretical calculus and benchmarks. In the first version of realistic problem, we propose a solution with itineraries calculated…

The module structure of Hochschild homology in some examples

2008

Abstract In this Note we give a simple proof of a conjecture by A. Caldararu stating the compatibility between the modified Hochschild–Kostant–Rosenberg isomorphism and the action of Hochschild cohomology on Hochschild homology in the case of Calabi–Yau manifolds and smooth projective curves. To cite this article: E. Macri` et al., C. R. Acad. Sci. Paris, Ser. I 346 (2008).

Improving Interpolants for Linear Arithmetic

2015

Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.

Forests and pattern-avoiding permutations modulo pure descents

2018

Abstract We investigate an equivalence relation on permutations based on the pure descent statistic. Generating functions are given for the number of equivalence classes for the set of all permutations, and the sets of permutations avoiding exactly one pattern of length three. As a byproduct, we exhibit a permutation set in one-to-one correspondence with forests of ordered binary trees, which provides a new combinatorial class enumerated by the single-source directed animals on the square lattice. Furthermore, bivariate generating functions for these sets are given according to various statistics.

On the Quadratic Type of Some Simple Self-Dual Modules over Fields of Characteristic Two

1997

Let G be a finite group and let K be an algebraically closed field of Ž characteristic 2. Let V be a non-trivial simple self-dual KG-module we . say that V is self-dual if it is isomorphic to its dual V * . It is a theorem of w x Fong 4, Lemma 1 that in this case there is a non-degenerate G-invariant alternating bilinear form, F, say, defined on V = V. We say that V is a KG-module of quadratic type if F is the polarization of a non-degenerate w x G-invariant quadratic form defined on V. In a previous paper 6 , the present authors described some methods to decide if such a module V is of w x quadratic type. One of the main results of 6 is the following. Suppose that Ž . G is a group with a s…

Links modulo knots and the isotopic realization problem

2001

Graphes connexes représentation des entiers et équirépartition

1983

Abstract Let q be an integer ≥2 and Ω a suitable subset of {0,…,q − 1}2; C (q; Ω) denotes the set of natural integers, the pairs of successive q-adic digits of which are in Ω. If P is an irrational polynomial, the sequence (P(n): n ∈ C (q; Ω)) is uniformly distributed modulo one.

Introduction to generalized topological spaces

2011

[EN] We introduce the notion of generalized topological space (gt-space). Generalized topology of gt-space has the structure of frame and is closed under arbitrary unions and finite intersections modulo small subsets. The family of small subsets of a gt-space forms an ideal that is compatible with the generalized topology. To support the definition of gt-space we prove the frame embedding modulo compatible ideal theorem. Weprovide some examples of gt-spaces and study key topological notions (continuity, separation axioms, cardinal invariants) in terms of generalized spaces.

Termination of a set of rules modulo a set of equations

2006

The problem of termination of a set R of rules modulo a set E of equations, called E-termination problem, arises when trying to complete the set of rules in order to get a Church-Rosser property for the rules modulo the equations. We first show here that termination of the rewriting relation and E-termination are the same whenever the used rewriting relation is E-commuting, a property inspired from Peterson and Stickel’s E-compatibility property. More precisely, their results can be obtained by requiring termination of the rewriting relation instead of E-termination if E-commutation is used instead of E-compatibility. When the rewriting relation is not E-commuting, we show how to reduce E-t…