Definability of arithmetical operations from binary quadratic forms
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...
The aim of this paper is to study determinants of matrices related to the Pascal triangle.
This note summarizes a presentation made at the Third International Meeting on Integer Valued Polynomials and Problems in Commutative Algebra. All the work behind it is joint with Scott T. Chapman, and will appear in [2]. Let represent the ring of polynomials with rational coefficients which are integer-valued at integers. We determine criteria for two such polynomials to have the same image set on .
We apply the larger sieve to bound the number of matrices not having large order when reduced modulo the primes in an interval. Our motivation is the relation with linear recursive congruential generators. Basically our results establish that the probability of finding a matrix with large order modulo many primes drops drastically when a certain threshold involving the number of primes and the order is exceeded. We also study, for a given prime and a matrix, the existence of nearby non-similar...