Related papers: $k$-Equivalence Relations and Associated Algorithm…
Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as…
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
Matching is a method of the design of experiments. If we had an even number of patients and wanted to form pairs of patients such that their ages, for example, in each pair be as close as possible, we would use nonbipartite matching. Not…
Straight lines are common features in human made environments, which makes them a frequently explored feature for control applications. Many control schemes, like Visual Servoing, require the 3D parameters of the features to be estimated.…
We review a possible framework for (non)linear quantum theories, into which linear quantum mechanics fits as well, and discuss the notion of ``equivalence'' in this setting. Finally, we draw the attention to persisting severe problems of…
Cosine-similarity is the cosine of the angle between two vectors, or equivalently the dot product between their normalizations. A popular application is to quantify semantic similarity between high-dimensional objects by applying…
The symmetry of polygons can be characterized by the number of symmetry axes they have. For $n$-polygons with $p$ or $p^2$ vertices $p\geq3$ there exist few symmetry categories, depending from the number of symmetry-axes the have. Further…
The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
A family of lines through the origin in Euclidean space is called equiangular if any pair of lines defines the same angle. The problem of estimating the maximum cardinality of such a family in $\mathbb{R}^n$ was extensively studied for the…
New examples of Cameron-Liebler line classes in $\mathrm{PG}(3,q)$ are given with parameter $\frac{1}{2}(q^2 -1)$. These examples have been constructed for many odd values of $q$ using a computer search, by forming a union of line orbits…
Rotational symmetry plays a central role in physics, providing an elegant framework to describe how the properties of 3D objects -- from atoms to the macroscopic scale -- transform under the action of rigid rotations. Equivariant models of…
In recent years a significant amount of research in quantum optics has been devoted to the analysis of atomic three-level systems and for many physical quantities the same effects have been predicted for different configurations. These…
We construct a new autoequivalence of the derived category of the Hilbert scheme of n points on a K3 surface, and of the variety of lines on a smooth cubic 4-fold. For Hilb^2 and the variety of lines, we use the theory of spherical…
Query complexity measures the amount of information an algorithm needs about a problem to compute a solution. On a quantum computer there are different realizations of a query and we will show that these are not always equivalent. Our…
A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…
Complementarity was originally introduced as a qualitative concept for the discussion of properties of quantum mechanical objects that are classically incompatible. More recently, complementarity has become a \emph{quantitative} relation…
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set…
A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates.…
When considering geometry, one might think of working with lines and circles on a flat plane as in Euclidean geometry. However, doing geometry in other spaces is possible, as the existence of spherical and hyperbolic geometry demonstrates.…