Related papers: Real and complexified configuration spaces for pla…
We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is…
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic which is a well studied logic in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem,…
This paper presents a MATLAB toolbox for computing the conformal mapping from a given polygonal multiply connected domain onto a circular multiply connected domain and its inverse. The toolbox can be used for multiply connected domains with…
We characterize and classify completely the planar 4R closed chain working on the Minkowskian plane. Our work would open a new research direction in the theory of geometric designs: the classification and characterization of the geometric…
We show that every rational knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_a(t), y = T_b(t), z = C(t)$ where $T_k(t)$ are the Chebyshev polynomials, $a=3$ and $b+ \deg C = 3N.$ We show that every rational knot also…
We present an explicit formula for the expected value of a product of several independent symplectically invariant matrices in which the trace and real part function may be applied, possibly to different subexpressions. This takes the form…
We construct the augmentation representation. It is a representation of the fundamental group of the link complement associated to an augmentation of the framed cord algebra. This construction connects representations of two link invariants…
We introduce a formal operational semantics that describes the fused execution of variable contraction problems, which compute indexed arithmetic over a semiring and generalize sparse and dense tensor algebra, relational algebra, and graph…
In engineering practice one often encounters planar problems, where the corresponding vector space of forces, velocities or (infinitesimal) displacements is three dimensional. This paper shows how these spaces can be factorized, such that…
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…
The graph of a real symplectic linear transformation is an R-Lagrangian subspace of a complex symplectic vector space. The restriction of the complex symplectic form is thus purely imaginary and may be expressed in terms of the generating…
In a recent work "Arc-presentation of links: Monotonic simplification" Ivan Dynnikov showed that each rectangular diagram of the unknot, composite link, or split link can be monotonically simplified into a trivial, composite, or split…
This paper presents a new way of describing cross fields based on fourth order tensors. We prove that the new formulation is forming a linear space in $\mathbb{R}^9$. The algebraic structure of the tensors and their projections on…
Regular expressions are widely used in software. Various regular expression engines support different combinations of extensions to classical regular constructs such as Kleene star, concatenation, nondeterministic choice (union in terms of…
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…
Real linear operators emerge in a range of mathematical physics applications. In this paper spectral questions of compact real linear operators are addressed. A Lomonosov-type invariant subspace theorem for antilinear compact operators is…
We present a friendly introduction to the very detailed results in [9,10,11] and as an illustration we discuss here the issue of {\em linearization of products}. We find some interesting new phenomena.
We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq.
We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…
We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…