Related papers: B\'{e}zout Identities Associated to a Finite Seque…
We present a simple iteration for the Lebesgue identity on partitions, which leads to a refinement involving the alternating sums of partitions.
We present in this work a complete session in a Mathematica notebook. The aim of this notebook is to check identities in symmetric compositions. This notebook is a complement of our work [1] and it has all the explicit computations. We…
This is a sequel to math.AG/0003009. Here we study identities for the Fourier transform of "elementary functions" over finite field containing "exponents" of monomial rational functions. It turns out that these identities are governed by…
This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras,…
We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…
Let $n$ be a positive integer, and define the rational function $S(x_1,\ldots,x_{2n})$ as the permanent of the matrix $[x_{j,k}]_{1\le j,k\le 2n}$, where $$x_{j,k}=\begin{cases}(x_j+x_k)/(x_j-x_k)&\text{if}\ j\not=k,\\1&\text{if}\…
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…
An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…
Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of $2\times 2$ minors of certain recursive matrices, the alternating sums of their $2\times 2$ minors, and the sums…
Polynomial generalizations of all 130 of the identities in Slater's list of identities of the Rogers-Ramanujan type are presented. Furthermore, duality relationships among many of the identities are derived. Some of the these polynomial…
We determine an infinite family of linear identities for the number $A_4(n)$ of partition pairs of $n$ with $4$-cores by employing elementary $q$-series techniques and certain $3$-dissection formulas. We then discover an infinite family of…
I use polynomial analogue of the Jacobi triple product identity together with the Eisenstein formula for the Legendre symbol modulo 3 . to prove six identities involving the $q$-binomial coefficients. These identities are then extended to…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…
We introduce discrete analogues of the exponential, sine, and cosine functions. Then using a discrete trigonometric version of a non-polynomial divided difference, we define discrete analogues of the trigonometric B-splines. We derive a…