Related papers: Universality of Polyhedral Linkages
Parties connected to independent sources through a network can generate correlations among themselves. Notably, the space of feasible correlations for a given network, depends on the physical nature of the sources and the measurements…
There are theories of coverings of $C^*$-algebras which can be included into a following list: coverings of commutative $C^*$-algebras, coverings of $C^*$-algebras of groupoids and foliations, coverings of noncommutative tori, the double…
The theory of universal Taylor series can be extended to the case of Pad\'e approximants where the universal approximation is not realized by polynomials any more, but by rational functions, namely the Pad\'e approximants of some power…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
The supersymmetric Poisson Sigma model is studied as a possible worldsheet realization of generalized complex geometry. Generalized complex structures alone do not guarantee non-manifest N=(2,1) or N=(2,2) supersymmetry, but a certain…
Let $X$ be a general complex projective hypersurface in $\mathbb{P}^{n+1}$ of degree $d>1$. A point $P$ not in $X$ is called uniform if the monodromy group of the projection of $X$ from $P$ is isomorphic to the symmetric group. We prove…
The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
A generalized formulation of non-relativistic quantum mechanics is developed within multidimensional geometric (NG) frameworks characterized by a power-law dispersion relation \(E \propto |p|^{j}\), where \(j = N - 1\). Starting from the…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…
Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V)…
On plane algebraic curves the so-called Weierstrass kernel plays the same role of the Cauchy kernel on the complex plane. A straightforward prescription to construct the Weierstrass kernel is known since one century. How can it be extended…
The linking integral is an invariant of the link-type of two manifolds immersed in a Euclidean space. It is shown that the ordinary Gauss integral in three dimensions may be simplified to a winding number integral in two dimensions. This…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…
For every $n\in \mathbb{N}$, we present a set $S_n$ of $O(n^{3/2}\log n)$ points in the plane such that every planar 3-tree with $n$ vertices has a straight-line embedding in the plane in which the vertices are mapped to a subset of $S_n$.…
In this paper we provide a \emph{global} investigation of the geometry of parallelizable manifolds (or absolute parallelism geometry) frequently used for application. We discuss the different linear connections and curvature tensors from a…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…
A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…
A. Girand has constructed an explicit two-parameter family of flat connections over the complex projective plane $\mathbb{P}^2$. These connections have dihedral monodromy and their polar locus is a prescribed quintic composed of a conic and…