Related papers: Cycle products and efficient vectors in reciprocal…

Given a finite set $\{M_0,\dots,M_{d-1}\}$ of nonnegative $2\times 2$ matrices and a nonnegative column-vector $V$, we associate to each $(\omega_n)\in\{0,\dots,d-1\}^\mathbb N$ the sequence of the column-vectors…

This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

We present explicit algorithms for computing structured matrix-vector products that are optimal in the sense of Strassen, i.e., using a provably minimum number of multiplications. These structures include Toeplitz/Hankel/circulant,…

This article gives a description of invariant subspaces for the backward shift generated by vector valued lacunary series and by a class of lacunary power series in $H^2(\mathbb{D}, X)$, (where $X$ is an Hilbert space). In particular, we…

A composite conductive material, which consists of fibers of a high conductivity in a matrix of low conductivity, is discussed. The effective conductivity of the system considered is calculated in Clausius-Mossotti approximation. Obtained…

Given a ring of ternions $R$, i. e., a ring isomorphic to that of upper triangular $2\times 2$ matrices with entries from an arbitrary commutative field $F$, a complete classification is performed of the vectors from the free left…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

We describe the structure of the irreducible representations of crossed products of unital C*-algebras by actions of finite groups in terms of irreducible representations of the C*-algebras on which the groups act. We then apply this…

An efficient coordinate-free notation is elucidated for differentiating matrix expressions and other functions between higher-dimensional vector spaces. This method of differentiation is known, but not explained well, in the literature.…

We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of $N=n_1\cdots n_m$ elements, where $m\geq 2$ and $n_i\geq 2$ for any $i=1,\ldots, m$. These elements are identified with the vertices…

We consider the characteristic polynomials of random unitary matrices $U$ drawn from various circular ensembles. In particular, the statistics of the coefficients of these polynomials are studied. The variances of these ``secular…

We prove that the Newton product of efficient polynomial projectors is still efficient. Various polynomial approximation theorems are established involving Newton product projectors on spaces of holomorphic functions on a neighborhood of a…

In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…

We introduce the concept of reflexive moment functional in two variables and the definition of reflexive orthogonal polynomial system. Also reverse matrices and their interesting algebraic properties are studied. Reverse matrices and…

Given standard angular momentum and boost matrices, the commutation rules for vector and momentum matrices are solved. The resulting matrix components are displayed as detailed functions of spin with factors such as the square root of…

The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…

An $n\times n$ matrix $M=[m_{ij}]$ with $m_{ij}\in U_n=\{1,2,\ldots,n\}$ will be called a cycle matrix if $(U_n,\cdot)$ is a cycle set, where $i\cdot j=m_{ij}$. We study these matrices in this article. Using these matrices, we give some…

This article gives the explicit solution to a general vector time series model that describes interacting, heterogeneous agents that operate under uncertainties but according to Keynesian principles, from which a model for business cycle is…

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…