Related papers: Real and complexified configuration spaces for pla…
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…
We prove that every triconnected planar graph is definable by a first order sentence that uses at most 15 variables and has quantifier depth at most $11\log_2 n+43$. As a consequence, a canonic form of such graphs is computable in $AC^1$ by…
An $\ell$-page stack layout (also known as an $\ell$-page book embedding) of a graph is a linear order of the vertex set together with a partition of the edge set into $\ell$ stacks (or pages), such that the endpoints of no two edges on the…
This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…
In this paper we describe all Lie bialgebra structures on the polynomial Lie algebra $\mathbf{g}[u]$, where $\mathbf{g}$ is a simple, finite dimensional, complex Lie algebra. The results are based on an unpublished paper Montaner and…
This study investigates the use of symbolic computation in Matrix Structural Analysis (MSA) for continuous beams, leveraging the MATLAB Symbolic Math Toolbox. By employing symbolic MSA, analytical expressions for displacements, support…
In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…
We classify moduli spaces of arrangements of 10 lines with quadruple points. We show that moduli spaces of arrangements of 10 lines with quadruple points may consist of more than 2 disconnected components, namely 3 or 4 distinct points. We…
Previous work has made use of a parameterized plane curve polynomial representation for mathematical handwriting, with the polynomials represented in a Legendre or Legendre-Sobolev graded basis. This provides a compact geometric…
In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…
We present the complex analytic and principal complex analytic realizability of a link in a 3-manifold $M$ as a tool for understanding the complex structures on the cone $C(M)$.
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
A real algebraic link in the 3-sphere is defined as the zero locus in the 3-sphere of a real algebraic function from $\mathbb{R}^4$ to $\mathbb{R}^2$. A real algebraic open book decomposition on the 3-sphere is by definition the Milnor…
The aim of this note is to characterize those doubly ordered frames $\langle X, \leq_1, \leq_2 \rangle$ which are embeddable into the canonical frame of its Urquhart complex algebra.
The total homology of the loop space of the configuration space of ordered distinct n points in R^m has a structure of a Hopf algebra defined by the 4-term relations if m>2. We describe a relation of between the cohomology of this loop…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
We propose relational linear programming, a simple framework for combing linear programs (LPs) and logic programs. A relational linear program (RLP) is a declarative LP template defining the objective and the constraints through the logical…
This is a survey article for "Handbook of Linear Algebra", 2nd ed., Chapman & Hall/CRC, 2014. An informal introduction to representations of quivers and finite dimensional algebras from a linear algebraist's point of view is given. The…
This material is a rewriting and expansion of notes for beginning graduate students in seminars in combinatorics (Department of Mathematics, University of California San Diego). Solid skills in linear and multilinear algebra were required…