Related papers: Explicit constructions of Vandermonde sequences us…
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain improved algorithms for the following problems: Approximate…
Many applications require the calculation of integrals of multidimensional functions. A general and popular procedure is to estimate integrals by averaging multiple evaluations of the function. Often, each evaluation of the function entails…
We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…
We present a property satisfied by a large variety of complex continued fraction algorithms (the "finite building property") and use it to explore the structure of bijectivity domains for natural extensions of Gauss maps. Specifically, we…
Random networks are increasingly used to analyse complex transportation networks, such as airline routes, roads and rail networks. So far, this research has been focused on describing the properties of the networks with the help of random…
We construct new linear codes with high minimum distance d. In at least 12 cases these codes improve the minimum distance of the previously known best linear codes for fixed parameters n,k. Among these new codes there is an optimal ternary…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…
Higher order digital nets are special classes of point sets for quasi-Monte Carlo rules which achieve the optimal convergence rate for numerical integration of smooth functions. An explicit construction of higher order digital nets was…
We present a quantum algorithm for computing the period lattice of infrastructures of fixed dimension. The algorithm applies to infrastructures that satisfy certain conditions. The latter are always fulfilled for infrastructures obtained…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
Let $\mathcal{A}$ be a finite-dimensional algebra over a finite field $\mathbf{F}_q$ and let $G=\mathcal{A}^\times$ be the multiplicative group of $\mathcal{A}$. In this paper, we construct explicitly a generic Galois $G$-extension $S/R$,…
We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…
We consider the vector linear solvability of networks over a field $\mathbb{F}_q.$ It is well known that a scalar linear solution over $\mathbb{F}_q$ exists for a network if and only if the network is \textit{matroidal} with respect to a…
We give new characterizations of the algebra $\mathscr{L}_n(\mathbb{F}_{q^n})$ formed by all linearized polynomials over the finite field $\mathbb{F}_{q^n}$ after briefly surveying some known ones. One isomorphism we construct is between…
We introduce a hybridization of digital sequences with uniformly distributed sequences in the domain of $b$-adic integers, $\mathbb Z_{b}, b\in\mathbb N\setminus\{1\}$, by using such sequences as input for generating matrices. The…
The values of the determinant of Vandermonde matrices with real elements are analyzed both visually and analytically over the unit sphere in various dimensions. For three dimensions some generalized Vandermonde matrices are analyzed…
Two square matrices of (arbitrary) order N are introduced. They are defined in terms of N arbitrary numbers z_{n}, and of an arbitrary additional parameter (a respectively q), and provide finite-dimensional representations of the two…
In this paper, we propose two algorithms for a hybrid construction of all $n\times n$ MDS and involutory MDS matrices over a finite field $\mathbb{F}_{p^m}$, respectively. The proposed algorithms effectively narrow down the search space to…