English
Related papers

Related papers: Real and complexified configuration spaces for pla…

200 papers

A four-bar linkage is a mechanism consisting of four rigid bars which are joined by their endpoints in a polygonal chain and which can rotate freely at the joints (or vertices). We assume that the linkage lies in the 2-dimensional plane so…

Dynamical Systems · Mathematics 2016-08-24 Alexandre Mauroy , Perouz Taslakian , Stefan Langerman , Raphaël Jungers

Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…

Combinatorics · Mathematics 2023-03-14 Amrita Mandal , Bibhas Adhikari

Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

The geometry of four-qubit entanglement is investigated. We replace some of the polynomial invariants for four-qubits introduced recently by new ones of direct geometrical meaning. It is shown that these invariants describe four points, six…

Quantum Physics · Physics 2009-11-13 Péter Lévay

We present a new method for solving parametrized linear systems. Under certain assumptions on the parametrization, solutions to the linear systems for all parameters can be accurately approximated by linear combinations of solutions to…

Numerical Analysis · Mathematics 2014-06-03 Anil Damle , Lin Lin , Lexing Ying

Motivated by the classical studies on transformations of conjugate nets, we develop the general geometric theory of transformations of their discrete analogues: the multidimensional quadrilateral lattices, i.e. lattices x: Z^N -> R^M, whose…

solv-int · Physics 2009-10-30 A. Doliwa , P. M. Santini , M. Manas

The paper deals with the process of mathematical modeling representations of exponential and logarithmic functions hypercomplex number system of generalized quaternions via determining a linear differential equation with hypercomplex…

General Mathematics · Mathematics 2016-11-22 Yakiv O. Kalinovsky , Yuliya E. Boyarinova , Dmitry V. Lande , Alina S. Sukalo

We show that any compact connected semialgebraic set is the projection of a connected component of the configuration space of a linkage.

Metric Geometry · Mathematics 2018-12-27 Henry C. King

This work provides a quaternioinc reprsentation for real symplectic matrices in dimension four, analogous to the pair of unit quaternions representation for special orthogonal matrices. In the process of finding formulae for this…

Mathematical Physics · Physics 2008-01-30 Yassmin Ansari , Viswanath Ramakrishna

We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model algorithms are arithmetic formula expressing symbolic…

Discrete Mathematics · Computer Science 2024-03-26 Hamilton Sawczuk , Edinah Gnang

We consider a hierarchy of many particle systems on the line with polynomial potentials separable in parabolic coordinates. Using the Lax representation, written in terms of $2\times 2$ matrices for the whole hierarchy, we construct the…

High Energy Physics - Theory · Physics 2009-10-22 J. C. Eilbeck , V. Z. Enol'skii , V. B. Kuznetsov , D. V. Leykin

In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand…

Geometric Topology · Mathematics 2013-09-16 Matt Mastin

The ongoing development of Lean 4's Mathlib has produced a macroscopic structural complexity that interweaves logical, mathematical, and infrastructural dependencies. We present a network analysis of this library, extracting its dependency…

Logic in Computer Science · Computer Science 2026-05-06 Xinze Li , Nanyun Peng , Simone Severini , Patrick Shafto

We show that if a braid $B$ can be parametrised in a certain way, then previous work can be extended to a construction of a polynomial $f:\mathbb{R}^4\to\mathbb{R}^2$ with the closure of $B$ as the link of an isolated singularity of $f$,…

Geometric Topology · Mathematics 2017-05-26 Benjamin Bode

In this paper, we study simplicial hyperplane arrangements in real projective $3$-space. We give a necessary condition for the characteristic polynomial to have only real roots, valid also for non-simplicial arrangements. As application, we…

Combinatorics · Mathematics 2021-08-31 David Geis

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Information Theory · Computer Science 2014-10-15 Hugues Randriambololona

It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…

Exactly Solvable and Integrable Systems · Physics 2015-05-13 James Atkinson

We use the recently introduced factorization theory of motion polynomials over the dual quaternions for the synthesis of closed kinematic loops with six revolute joints that visit four prescribed poses. Our approach admits either no or a…

Robotics · Computer Science 2015-03-24 Gábor Hegedüs , Josef Schicho , Hans-Peter Schröcker

We show that direct Feynman-parametric loop integration is possible for a large class of planar multi-loop integrals. Much of this follows from the existence of manifestly dual-conformal Feynman-parametric representations of planar loop…

High Energy Physics - Theory · Physics 2022-08-24 Jacob L. Bourjaily , Andrew J. McLeod , Matt von Hippel , Matthias Wilhelm

A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is…

Computational Geometry · Computer Science 2026-04-08 Thomas Depian , Carolina Haase , Martin Nöllenburg , André Schulz