Related papers: A parameterized linear formulation of the integer …

Injective metric spaces, or absolute 1-Lipschitz retracts, share a number of properties with CAT(0) spaces. In the 1960es, J. R. Isbell showed that every metric space X has an injective hull E(X). Here it is proved that if X is the vertex…

We consider a planar Hamiltonian system of the type $Jz' = \nabla_z H(t,z)$, where $H: \mathbb{R} \times \mathbb{R}^2 \to \mathbb{R}$ is a function periodic in the time variable, such that $\nabla_z H(t,0) \equiv 0$ and $\nabla_z H(t,z)$ is…

We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$. We…

Let $\mathcal{A}$ be the class of unital separable simple amenable $C$*-algebras $A$ which satisfy the Universal Coefficient Theorem for which $A\otimes M_{\texttt{P}}$ has tracial rank zero for some supernatural number $\texttt{p}$ of…

Let $V$ be a complex linear space, $G\subset\GL(V)$ be a compact group. We consider the problem of description of polynomial hulls $\wh{Gv}$ for orbits $Gv$, $v\in V$, assuming that the identity component of $G$ is a torus $T$. The paper…

We show that computing the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points over a field of $k^{O(1)}$ elements requires $k^{\Omega(k)}$ time unless the \#ETH---a counting extension of the Exponential Time…

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

The matrix code equivalence problem consists, given two matrix spaces $\mathcal{C},\mathcal{D} \subset \mathbb{F}_q^{m\times n}$ of dimension $k$, in finding invertible matrices $P\in\mathrm{GL}_m(\mathbb{F}_q)$ and…

We consider the translational hull $\Omega(I)$ of an arbitrary subsemigroup $I$ of an endomorphism monoid $\mathrm{End}(A)$ where $A$ is a universal algebra. We give conditions for every bi-translation of $I$ to be realised by…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…

It is a notorious open question whether integer programs (IPs), with an integer coefficient matrix $M$ whose subdeterminants are all bounded by a constant $\Delta$ in absolute value, can be solved in polynomial time. We answer this question…

A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x…

An $n \times n$ matrix $H$ is Butson-Hadamard if its entries are $k^{\text{th}}$ roots of unity and it satisfies $HH^* = nI_n$. Write $BH(n, k)$ for the set of such matrices. Suppose that $k = p^{\alpha}q^{\beta}$ where $p$ and $q$ are…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

We prove a general criterion for a von Neumann algebra $M$ in order to be in standard form. It is formulated in terms of an everywhere defined, invertible, antilinear, a priori not necessarily bounded operator, intertwining $M$ with its…

We introduce the \emph{universal algebra} of two Poisson algebras $P$ and $Q$ as a commutative algebra $A:={\mathcal P} (P, \, Q )$ satisfying a certain universal property. The universal algebra is shown to exist for any finite dimensional…