Related papers: Left-eigenvectors are certificates of the Orbit Pr…
We give a convergent hierarchy of SDP certificates for bounding the spectral gap of local qubit Hamiltonians from below. Our approach is based on the NPA hierarchy applied to a polynomially-sized system of constraints defining the universal…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
When extending the Ehrhart lattice point enumerator $L_P(t)$ to allow real dilation parameters $t$, we lose the invariance under integer translations that exists when $t$ is restricted to be an integer. This paper studies this phenomenon;…
We solve the problem of inversion of an extended Abel-Jacobi map $$ \int_{P_{0}}^{P_{1}}\omega +...+\int_{P_{0}}^{P_{g+n-1}}\omega ={\bf z}, \qquad \int_{P_{0}}^{P_{1}}\Omega_{j1}+... +\int_{P_{0}}^{P_{g+n-1}}\Omega_{j1} =Z_{j},\quad…
In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasible point. The underlying idea is to use the infeasible point…
A systematic development of the so-called Palatini formalism is carried out for pseudo-Finsler metrics $L$ of any signature. Substituting in the classical Einstein-Hilbert-Palatini functional the scalar curvature by the Finslerian Ricci…
The Permutation Equivalence Problem (PEP) for linear codes is a fundamental problem in coding theory and cryptography. A recent reduction shows that PEP for Linear Complementary Dual (LCD) codes reduces to Graph Isomorphism (GI) via…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
Linear Complementarity Problems (LCPs) with sufficient matrices form an important subclass of LCPs, and it remains a significant open question whether problems in this class can be solved in polynomial time. Kojima, Megiddo, Noma, and…
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a-possibly randomized- verification algorithm that proves the correctness of each output. Wiede-mann's algorithm projects the…
Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…
The phase space of an integrable Hamiltonian system is foliated by invariant tori. For an arbitrary Hamiltonian H such a foliation may not exist, but we can artificially construct one through a parameterised family of surfaces, with the…
We construct noncomplete orthogonal systems on the ray $[0,\infty)$ that look like Jacobi polynomials $P_n(x)$ after a shift of degree $n\mapsto n+a$, where $a$ is a real constant. These systems are solutions of some exotic Sturm-Liouville…
Multi-matrix invariants, and in particular the scalar multi-trace operators of $\mathcal{N}=4$ SYM with $U(N)$ gauge symmetry, can be described using permutation centraliser algebras (PCA), which are generalisations of the symmetric group…
The deformations of the Galilei algebra and their associated noncommutative Newtonian spacetimes are investigated. This is done by analyzing the possible nonrelativistic limits of an eleven generator (pseudo)extended \kap-Poincar\'e algebra…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
A generalized variant of the Calder\'on problem from electrical impedance tomography with partial data for anisotropic Lipschitz conductivities is considered in an arbitrary space dimension $n \geq 2$. The following two results are shown:…
The Hirota-Miwa equation (also known as the discrete KP equation, or the octahedron recurrence) is a bilinear partial difference equation in three independent variables. It is integrable in the sense that it arises as the compatibility…
We consider the Dirichlet-to-Neumann map $\Lambda$ on a cylinder-like Lorentzian manifold related to the wave equation related to the metric $g$, a magnetic field $A$ and a potential $q$. We show that we can recover the jet of $g,A,q$ on…
This paper presents an innovative set of tools developed to support a methodology to find the left eigenvalues of $m$ order quaternion square matrix. It is solving four real polynomial equations of order not greater than $4m-3$ in four…