Related papers: What's in a Pauli Matrix?
Intuitively, an envelope of a family of curves is a curve that is tangent to a member of the family at each point. Here we use envelopes of families of circles to study objects from matrix theory and hyperbolic geometry. First we explore…
Enumerative Geometry is concerned with the number of solutions to a structured system of polynomial equations, when the structure comes from geometry. Enumerative real algebraic geometry studies real solutions to such systems, particularly…
If $X$ is a variety with an additional structure $\xi$, such as a marked point, a divisor, a polarization, a group structure and so forth, then it is possible to study whether the pair $(X,\xi)$ is defined over the field of moduli. There…
Recently, a geometrical characterization of vector spaces served to generalize them into a new class of algebras. Instead of the algebraic properties of the underlying fields, we generalized the recently discovered property of such spaces…
Phylogenetic algebraic geometry is concerned with certain complex projective algebraic varieties derived from finite trees. Real positive points on these varieties represent probabilistic models of evolution. For small trees, we recover…
In this paper geometry is studied with a novel approach. Every geometrical object is defined as a symbol which satisfies some properties. These symbols are then coded into a class of numbers which are named here as many dots numbers (MDN).…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…
Results of number of geometric operations (often used in technical practise, as e.g. the operation of blending) are in many cases surfaces described implicitly. Then it is a challenging task to recognize the type of the obtained surface,…
A parametric manifold can be viewed as the manifold of orbits of a (regular) foliation of a manifold by means of a family of curves. If the foliation is hypersurface orthogonal, the parametric manifold is equivalent to the 1-parameter…
We discuss the most elementary properties of the hyperbolic trigonometry and show how they can be exploited to get a simple, albeit interesting, geometrical interpretation of the special relativity. It yields indeed a straightforword…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
General structure of the multivariate plain and q-hypergeometric terms and univariate elliptic hypergeometric terms is described. Some explicit examples of the totally elliptic hypergeometric terms leading to multidimensional integrals on…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal…
Based on work presented in [4], we define $S^2$-Upper Triangular Matrices and $S^2$-Lower Triangular Matrices, two special types of $d\times d(2d-1)$ matrices generalizing Upper and Lower Triangular Matrices, respectively. Then, we show…
This is an overview of recent results aimed at developing a geometry of noncommutative tori with real multiplication, with the purpose of providing a parallel, for real quadratic fields, of the classical theory of elliptic curves with…
A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Polygons are compound geometric objects, but when trying to understand the expected behavior of a large collection of random polygons -- or even to formalize what a random polygon is -- it is convenient to interpret each polygon as a point…