Related papers: On the structure of finitely generated shift-invar…
In this paper, we study multivariate vector sampling expansions on general finitely generated shift-invariant subspaces. Necessary and sufficient conditions for a multivariate vector sampling theorem to hold are given.
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…
The rank of a point-line geometry G is usually defined as the generating rank of G, namely the minimal cardinality of a generating set. However, when the subspace lattice of G satisfies the Exchange Property we can also try a different…
Affinely closed homogeneous spaces G/H, i.e., affine homogeneous spaces that admit only the trivial affine embedding, are characterized for any affine algebraic group G. As a corollary, a description of affine G-algebras with finitely…
We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.
We develop explicit formulae for the eigenvalues of various invariants for highest weight irreducible representations of the quantum supergroup $U_q[gl(m|n)]$. The techniques employed make use of modified characteristic identity methods and…
Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…
Let $G$ be a finite reductive group defined over $\mathbb{F}_q$, with $q$ a power of a prime $p$. Motivated by a problem recently posed by C. Curtis, we first develop an algorithm to express each element of $G$ into a canonical form in…
A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point…
Recently the algebraic structure of gauge-invariant operators in multi-matrix quantum mechanics has been clarified: this space forms a module over a freely generated ring. The ring is generated by a set of primary invariants, while the…
Fast Fourier transforms are used to develop algorithms for the fast generation of correlated Gaussian random fields on d-dimensional rectangular regions. The complexities of the algorithms are derived, simulation results and error analysis…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
In this paper we construct explicit sampling sets and present reconstruction algorithms for Fourier signals on finite vector spaces $G$, with $|G|=p^r$ for a suitable prime $p$. The two sets have sizes of order $O(pt^2r^2)$ and…
We construct a sequence ${\phi_i(\cdot-j)\mid j\in{\ZZ}, i=1,...,r}$ which constitutes a $p$-frame for the weighted shift-invariant space [V^p_{\mu}(\Phi)=\Big{\sum\limits_{i=1}^r\sum\limits_{j\in{\mathbb{Z}}}c_i(j)\phi_i(\cdot-j) \Big|…
Fractional supersymmetric quantum mechanics of order $\lambda$ is realized in terms of the generators of a generalized deformed oscillator algebra and a Z$_{\lambda}$-grading structure is imposed on the Fock space of the latter. This…
This work is devoted to the so-called filtration theory of semigroup generators in the unit disk. It should be noted that numerous filtrations studied to nowdays have been introduced for different purposes and considered from different…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
To each finitely generated group $G$, we associate a quasi-isometric invariant called the \emph{Dehn spectrum} of $G$. If $G$ is finitely presented, our invariant is closely related to the Dehn function of $G$, but provides more information…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…