Related papers: $k$-Equivalence Relations and Associated Algorithm…
We report briefly on an approach to quantum theory entirely based on symmetry grounds which improves Geometric Quantization in some respects and provides an alternative to the canonical framework. The present scheme, being typically…
In this paper we introduce a new formalism for $K$-theory, called squares $K$-theory. This formalism allows us to simultaneously generalize the usual three-term relation $[B] = [A] + [C]$ for an exact sequence $A \hookrightarrow B…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in $\mathbb{R}^n$ was studied extensively for the last 70 years. In this paper, we…
Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…
A stationary stable solution of the Stokes equations for three identical heavy solid spheres falling in a vertical plane is found. It has no analog in the point-particle approximation. Three spheres aligned horizontally at equal distances…
The calculation of loop amplitudes with parity violation or spin effects within dimensional regularization needs a consistent definition of gamma5. Also loop calculations in supersymmetric theories need a consistent definition of gamma5. In…
An equilevel algebra is a subalgebra of the space of smooth functions $f: M \to {\mathbb R}$ distinguished in this space by finitely many linear conditions of the type $f(x_i) = f(\tilde x_i)$, $x_i \neq \tilde x_i \in M$, or approximated…
In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
We say that a line in $\mathbb P^{n+1}_k$ is osculating to a hypersurface $Y$ if they meet with contact order $n+1$. When $k=\mathbb C$, it is known that through a fixed point of $Y$, there are exactly $n!$ of such lines. Under some parity…
Chen and Chv\'atal conjectured in 2008 that in any finite metric space either there is a line containing all the points - a universal line -, or the number of lines is at least the number of points. This is a generalization of a classical…
With an eye on developing a quantum theory of gravity, many physicists have recently searched for quantum challenges to the equivalence principle of general relativity. However, as historians and philosophers of science are well aware, the…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…
PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\in\{0,1,...,n-1\}$ with the $x^{\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to…
We approximate the uniform measure on an equilateral triangle by a measure supported on $n$ points. We find the optimal sets of points ($n$-means) and corresponding approximation (quantization) error for $n\leq4$, give numerical…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
In this article, circular arcs are considered both individually and as elements of a piecewise circular curve. The endpoint parameterization proves to be quite advantageous here. The perspective of symplectic geometry provides new vectorial…
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…