Computer-aided serendipity
We develop a recursive method for computing the -removed -orderings and -orderings of order the characteristic sequences associated to these and limits associated to these sequences for subsets of a Dedekind domain This method is applied to compute these objects for and .
In this paper we study an action of the absolute Galois group on bicolored plane trees. In distinction with the similar action provided by the Grothendieck theory of “Dessins d’enfants” the action is induced by the action of on equivalence classes of conservative polynomials which are the simplest examples of postcritically finite rational functions. We establish some basic properties of the action and compare it with the Grothendieck action.
For n ∈ ℕ, L > 0, and p ≥ 1 let be the largest possible value of k for which there is a polynomial P ≢ 0 of the form , , , such that divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that . We find the size of and for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even in that special...
On page 211, line 9, and on page 213, line -6, the assumption should be added that F is not the product of generalized cyclotomic polynomials.
Consider the group over the ring of algebraic integers of a number field . Define the height of a matrix to be the maximum over all the conjugates of its entries in absolute value. Let be the number of matrices in with height bounded by . We determine the asymptotic behaviour of as goes to infinity including an error term,with being the degree of . The constant involves the discriminant of , an integral depending only on the signature of , and the value of the Dedekind zeta function...
This is a survey of recent results concerning (integer) matrices whose leading principal minors are well-known sequences such as Fibonacci, Lucas, Jacobsthal and Pell (sub)sequences. There are different ways for constructing such matrices. Some of these matrices are constructed by homogeneous or nonhomogeneous recurrence relations, and others are constructed by convolution of two sequences. In this article, we will illustrate the idea of these methods by constructing some integer matrices of this...
Let be a finite subset of a partially ordered set . Let be an incidence function of . Let denote the matrix having evaluated at the meet of and as its -entry and denote the matrix having evaluated at the join of and as its -entry. The set is said to be meet-closed if for all . In this paper we get explicit combinatorial formulas for the determinants of matrices and on any meet-closed set . We also obtain necessary and sufficient conditions for the matrices...