Search results for "Combinatorics"

Vassiliev invariants for braids on surfaces

2000

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit an universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the considered surface.

On the gonality and the slope of a fibered surface

2018

Abstract Let f : X → B be a locally non-trivial relatively minimal fibration of curves of genus g ≥ 2 . We obtain a lower bound of the slope λ ( f ) increasing with the gonality of the general fiber of f. In particular, we show that λ ( f ) ≥ 4 provided that f is non-hyperelliptic and g ≥ 16 .

INITIAL PARAMETRIC REPRESENTATION OF BLOBS

2009

Blobs, developed by J.F. Blinn in 1982, are the implicit surfaces obtained by composition of a real numerical function and a distance function. Since, many authors (C. Murakami, H. Nishimura, G. Wyvill…) defined their own function of density, from these implicit surfaces are interesting from several points of view. In particular, their fusion makes it possible to easily obtain an implicit equation of resulting surface. However, these surfaces do not admit a parametric equation yet. In this article, we will establish the parametric equation of two blobs in fusion, defined by the function of density of C. Murakami, by using an algebraic method. Then, we will develop another method, based on …

2021

Abstract We extend the classical Carathéodory extension theorem to quasiconformal Jordan domains (Y, dY ). We say that a metric space (Y, dY ) is a quasiconformal Jordan domain if the completion ̄Y of (Y, dY ) has finite Hausdorff 2-measure, the boundary ∂Y = ̄Y \ Y is homeomorphic to 𝕊1, and there exists a homeomorphism ϕ: 𝔻 →(Y, dY ) that is quasiconformal in the geometric sense. We show that ϕ has a continuous, monotone, and surjective extension Φ: 𝔻 ̄ → Y ̄. This result is best possible in this generality. In addition, we find a necessary and sufficient condition for Φ to be a quasiconformal homeomorphism. We provide sufficient conditions for the restriction of Φ to 𝕊1 being a quasi…

The S-kernel: A measure of symmetry of objects

2007

In this paper we introduce a new symmetry feature named ''symmetry kernel'' (SK) to support a measure of symmetry. Given any symmetry transform S, SK of a pattern P is the maximal included symmetric sub-set of P for all directions and shifts. We provide a first algorithm to exhibit this kernel where the centre of symmetry is assumed to be the centre of mass. Then we prove that, in any direction, the optimal axis corresponds to the maximal correlation of a pattern with its symmetric version. That leads to a second algorithm. The associated symmetry measure is a modified difference between the respective surfaces of a pattern and its kernel. A series of experiments supports the actual algorit…

Systems of quasilinear elliptic equations with dependence on the gradient via subsolution-supersolution method

2017

For the homogeneous Dirichlet problem involving a system of equations driven by \begin{document}$(p,q)$\end{document} -Laplacian operators and general gradient dependence we prove the existence of solutions in the ordered rectangle determined by a subsolution-supersolution. This extends the preceding results based on the method of subsolution-supersolution for systems of elliptic equations. Positive and negative solutions are obtained.

Formulations and valid inequalities for the capacitated dispersion problem

2023

This work focuses on the capacitated dispersion problem for which we study several mathematical formulations in different spaces using variables associated with nodes, edges, and costs. The relationships among the presented formulations are investigated by comparing the projections of the feasible sets of the LP relaxations onto the subspace of natural variables. These formulations are then strengthened with families of valid inequalities and variable-fixing procedures. The separation problems associated with the valid inequalities that are exponential in number are shown to be polynomially solvable by reducing them to longest path problems in acyclic graphs. The dual bounds obtained from s…

Design of temperature control system using conventional PID and Intelligent Fuzzy Logic controller

2015

In this paper, we present the design of temperature control for industrial heat treating furnace by using Intelligent Fuzzy Logic and PID controllers. Temperature control is important in heating processes as it can disqualify materials in terms of their physical properties when not well performed. Obviously PID temperature controller is the most used in industries to control non-linear processes. Consequently, it has been found that the output response from Fuzzy Logic is very accurate in terms of overshoot and steady state error when compared to that of PID. Moreover, both temperature controllers are modeled and simulated using MATLAB software.

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

2006

AbstractP. Chase and F. Ruskey each published a Gray code for length n binary strings with m occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing from one binary string to its successor a single 1 exchanges positions with a 0 which is either adjacent to the 1 or separated from it by a single 0. If we impose the restriction that any suffix of a string contains at least k−1 times as many 0's as 1's, we obtain k-suffixes: suffixes of k-ary Dyck words. Combinations are retrieved as special case by setting k=1 and k-ary Dyck words are retrieved as a special case by imposing the additional condition that the entire string has exactly k−1 times as many 0's a…

On parsing optimality for dictionary-based text compression—the Zip case

2013

Dictionary-based compression schemes are the most commonly used data compression schemes since they appeared in the foundational paper of Ziv and Lempel in 1977, and generally referred to as LZ77. Their work is the base of Zip, gZip, 7-Zip and many other compression software utilities. Some of these compression schemes use variants of the greedy approach to parse the text into dictionary phrases; others have left the greedy approach to improve the compression ratio. Recently, two bit-optimal parsing algorithms have been presented filling the gap between theory and best practice. We present a survey on the parsing problem for dictionary-based text compression, identifying noticeable results …