Related papers: Multidimensional Shifts And Finite Matrices
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via component-by-component search algorithms. A striking…
We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and…
The aim of this paper is to develop foundations of umbral calculus on the space $\mathcal D'$ of distributions on $\mathbb R^d$, which leads to a general theory of Sheffer polynomial sequences on $\mathcal D'$. We define a sequence of monic…
The following article treats about convex geometries which are lower semi-modular and join semi-distributive lattices. Firstly, it is shown that there is a class $K$ of infinite convex geometries which can be build out of finite ones by…
The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…
Even though big mapping class groups are not countably generated, certain big mapping class groups can be generated by a coarsely bounded set and have a well defined quasi-isometry type. We show that the big mapping class group of a stable…
We prove an additivity for evenly (oddly) finite dimensional objects in distinguished triangles in a triangulated monoidal category structured by an underlying model monoidal category. In particular, the result holds in the Q-localized…
We prove that generating subspaces of matrix rings over finite fields are counted by polynomials. We use this result to define and study two-variable versions of polynomials counting isomorphism classes of absolutely irreducible…
In this paper we generalize the Ritt-Kolchin method of characteristic sets and the classical Gr\"obner basis technique to prove the existence and obtain methods of computation of multivariate difference-differential dimension polynomials…
Let F(X) be the set of finite nonempty subsets of a set X. We have found the necessary and sufficient conditions under which for a given function f:F(X)-->R there is an ultrametric on X such that f(A)=diam A for every A\in F(X). For finite…
In this paper, we construct derived equivalences between matrix subrings. As applications, we calculate the global dimensions and the finitistic dimensions of some matrix subrings. And we show that the finitistic dimension conjecture holds…
This note describes a technique for generating large non-singular matrices with blocks of full rank. Our motivation to construct such matrices arises in the white-box implementation of cryptographic algorithms with S-boxes.
We consider finitely generated shift-invariant spaces (SIS) with additional invariance in $L^2(\R^d)$. We prove that if the generators and their translates form a frame, then they must satisfy some stringent restrictions on their behavior…
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…
The degree of mixing is a fundamental property of a dynamical system. General multi-dimensional shifts cannot be systematically determined. This work introduces constructive and systematic methods for verifying the degree of mixing, from…
The main purpose of this article is to introduce some new binomial difference sequence spaces of fractional order ${\tilde{\alpha}} $ along with infinite matrices. Some topological properties of these spaces are considered along with the…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
Given a one-dimensional shift $X$, let $|F_X(\ell)|$ be the number of follower sets of words of length $\ell$ in $X$. We call the sequence $\{|F_X(\ell)|\}_{\ell \in \mathbb{N}}$ the follower set sequence of the shift $X$. Extender sets are…