Related papers: Maximal Circular Point Sets over Arbitrary Fields …
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
We study circuit complexity for conformal field theory states in arbitrary dimensions. Our circuits start from a primary state and move along a unitary representation of the Lorentzian conformal group. Different choices of distance…
The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…
We prove upper bounds on the number of rational points on transcendental curves in arbitrary $1$-h-minimal fields, similar to the Pila--Wilkie counting theorem in the o-minimal setting. These results extend results due to…
This paper contributes to the theory of orders of number fields. This paper defines a notion of "ray class group" associated to an arbitrary order in a number field together with an arbitrary ray class modulus for that order (including…
We present an axiomatic approach to finite- and infinite-dimensional differential calculus over arbitrary infinite fields (and, more generally, suitable rings). The corresponding basic theory of manifolds and Lie groups is developed.…
Motivated by problems arising in the relative trace formula and arithmetic invariant theory we prove the existence of rational points on orbits arising from certain infinitesimal symmetric spaces. As an application, we prove analogous…
The orbit closure of the unfolding of every rational right and isosceles triangle is computed and the asymptotic number of periodic billiard trajectories in these triangles is deduced. This follows by classifying all orbit closures of rank…
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…
In a previous work \cite{mbeleka}, we have modelled the rotation curves (RC) of spiral galaxies by including in the equation of motion dynamical terms from an external real self-interacting scalar field, $\phi$, minimally coupled to gravity…
We consider $n$-dimensional discrete motions such that any two neighbouring positions correspond in a pure rotation ("rotating motions"). In the Study quadric model of Euclidean displacements these motions correspond to quadrilateral nets…
Regions in the Euclidean plane surrounded by circles are fundamental geometric and combinatorial objects. Related studies have been done and we cannot explain them precisely, or roughly, well. We study such regions whose Poincar\'e-Reeb…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…
Circumcenters play an important role in the design and analysis of accelerating various iterative methods in optimization. In this work, we propose Bregman (pseudo-)circumcenters associated with finite sets. We show the existence and give…
A general strategy is given for the classification of graphs of rational surface singularities. For each maximal rational double point configuration we investigate the possible multiplicities in the fundamental cycle. We classify completely…
We say that a subset of $\mathbb{P}^n(\mathbb{R})$ is maximally singular if its contains points with $\mathbb{Q}$-linearly independent homogenous coordinates whose uniform exponent of simultaneous rational approximation is equal to $1$, the…
The present paper analyzes the discrepancy of distribution of rational points on general semisimple algebraic group varieties. The results include mean-square, almost sure, and uniform discrepancy estimates with explicit error bounds, which…
A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…