Search

In this paper, we study the desingularization problem in the first q -Weyl algebra. We give an order bound for desingularized operators, and thus derive an algorithm for computing desingularized operators in the first q -Weyl algebra. Moreover, an algorithm is presented for computing a generating set of the first q -Weyl closure of a given q -difference operator. As an application, we certify that several instances of the colored Jones polynomial are Laurent polynomial sequences by computing the corresponding desingularized operator. [ABSTRACT FROM AUTHOR]

Abstract: In a recent paper (Cucker et al., 2008 ) we analyzed a numerical algorithm for computing the number of real zeros of a polynomial system. The analysis relied on a condition number for the input system f. In this paper we look at as a random variable derived from imposing a probability measure on the space of polynomial systems and give bounds for both the tail and the expected value . [Copyright &y& Elsevier]

Abstract: Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let denote the set of minimal permutations of length n with d descents, and let . They showed that and , where is the n-th Catalan number. Mansour and Yan proved that . In this paper, we consider the problem of counting minimal permutations in with a prescribed set of ascents, and we show that they are in one-to-one correspondence with a class of skew Young tableaux, which we call 2-regular skew tableaux. Using the determinantal formula for the number of skew Young tableaux of a given shape, we find an explicit formula for . Furthermore, by using the Knuth equivalence, we give a combinatorial interpretation of a formula for a refinement of the number . [Copyright &y& Elsevier]

Abstract: The gap function of an infinite word over the binary alphabet gives the distances between consecutive 1''s in this word. In this paper we study infinite binary words whose gap function is injective or “almost injective.” A method for computing the subword complexity of such words is given. A necessary and sufficient condition for a function to be the subword complexity function of a binary word whose gap function is increasing is obtained. [Copyright &y& Elsevier]