Search results for "Combinatorics"

A Characterization of Quintic Helices

2005

A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.

Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses

2013

International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…

The behavior of solutions of a parametric weighted (p, q)-laplacian equation

2021

<abstract><p>We study the behavior of solutions for the parametric equation</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ -\Delta_{p}^{a_1} u(z)-\Delta_{q}^{a_2} u(z) = \lambda |u(z)|^{q-2} u(z)+f(z,u(z)) \quad \mbox{in } \Omega,\, \lambda >0, $\end{document} </tex-math></disp-formula></p> <p>under Dirichlet condition, where $ \Omega \subseteq \mathbb{R}^N $ is a bounded domain with a $ C^2 $-boundary $ \partial \Omega $, $ a_1, a_2 \in L^\infty(\Omega) $ with $ a_1(z), a_2(z) > 0 $ for a.a. $ z \in \Omega $, $ p, q \in (1, \infty) $ and $ \Delta_{p}^{a_1}, \Delta_{q}^{a_2} $ are weighted …

A rank theorem for analytic maps between power series spaces

1994

On the Size Complexity of Deterministic Frequency Automata

2013

Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…

On the number of different prime divisors of element orders

2005

We prove that the number of different prime divisors of the order of a finite group is bounded by a polynomial function of the maximum of the number of different prime divisors of the element orders. This improves a result of J. Zhang.

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Suffix Automata and Standard Sturmian Words

2007

Blumer et al. showed (cf. [3,2]) that the suffix automaton of a word w must have at least |w|+1 states and at most 2|w|-1 states. In this paper we characterize the language L of all binary words w whose minimal suffix automaton S(w) has exactly |w| + 1 states; they are precisely all prefixes of standard Sturmian words. In particular, we give an explicit construction of suffix automaton of words that are palindromic prefixes of standard words. Moreover, we establish a necessary and sufficient condition on S(w) which ensures that if w ∈ L and a ∈ {0, 1} then wa ∈ L. By using such a condition, we show how to construct the automaton S(wa) from S(w). More generally, we provide a simple construct…

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

$V$-filtrations in positive characteristic and test modules

2013

Let $R$ be a ring essentially of finite type over an $F$-finite field. Given an ideal $\mathfrak{a}$ and a principal Cartier module $M$ we introduce the notion of a $V$-filtration of $M$ along $\mathfrak{a}$. If $M$ is $F$-regular then this coincides with the test module filtration. We also show that the associated graded induces a functor $Gr^{[0,1]}$ from Cartier crystals to Cartier crystals supported on $V(\mathfrak{a})$. This functor commutes with finite pushforwards for principal ideals and with pullbacks along essentially \'etale morphisms. We also derive corresponding transformation rules for test modules generalizing previous results by Schwede and Tucker in the \'etale case (cf. ar…