Related papers: Maximal Circular Point Sets over Arbitrary Fields …
We define circuits given by unitary representations of Lorentzian conformal field theory in 3 and 4 dimensions. Our circuits start from a spinning primary state, allowing us to generalize formulas for the circuit complexity obtained from…
The purpose of this paper is to link anisotropy properties of an algebraic group together with compactness issues in the topological group of its rational points. We nd equivalent conditions on a smooth ane algebraic group scheme over a…
This article discusses a way for uniquely setting up the valuations for the minimal generators of the maximal ideal of a one dimensional complete reduced and irreducible local algebra over an algebraically closed field, when treated as a…
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and then we describe and implement a computer-based method to…
We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being…
The architecture of infinite structures with non-crystallographic symmetries can be modeled via aperiodic tilings, but a systematic construction method for finite structures with non-crystallographic symmetry at different radial levels is…
A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many…
A generalization of the original Diffie-Hellman key exchange in $(\Z/p\Z)^*$ found a new depth when Miller and Koblitz suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we propose a further…
We study discrete random fields $\{X_t: t\in \mathbb{Z}^d\}$ parameterized on the $d$-dimensional integer lattice $\mathbb{Z}^d$. For a fixed threshold $u$, the excursion set $\{t \in \mathbb{Z}^d : X_t > u\}$ decomposes into connected…
The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…
In this paper we examine isotropic Gaussian random fields defined on $\mathbb R^N$ satisfying certain conditions. Specifically, we investigate the type of a critical point situated within a small vicinity of another critical point, with…
In this paper, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…
We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…
Various methods have been used to construct rational points and rational curves on rationally connected algebraic varieties. We survey recent advances in two of them, the descent and the fibration method, in a number-theoretical context…
We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…
Let R be a finite principal left ideal ring. Via a total ordering of the ring elements and an ordered basis a lexicographic ordering of the module R^n is produced. This is used to set up a greedy algorithm that selects vectors for which all…
We provide new explicit formulas for bounding the number of rational points on singular curves over finite fields. This enables us to obtain exact values of N q (g, $\pi$) which is defined as the maximum number of rational points over F q…
We discuss and compare several geometric structures which imply an upper bound to the acceleration of a particle measured in its rest system. While all of them have the same implications on the motion of a point particle, they differ in…