Related papers: Diagonalization Without Relativization A Closer Lo…
We consider two distinct limits of General Relativity that in contrast to the standard non-relativistic limit can be taken at the level of the Einstein-Hilbert action instead of the equations of motion. One is a non-relativistic limit and…
We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time…
We say that a list of complex numbers is "realisable" if it is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (NIEP) is the problem of characterising all realisable lists. Although the NIEP…
One of the fundamental open questions in computational complexity is whether the class of problems solvable by use of stochasticity under the Random Polynomial time (RP) model is larger than the class of those solvable in deterministic…
We establish an equivalence between a family of adversarial training problems for non-parametric binary classification and a family of regularized risk minimization problems where the regularizer is a nonlocal perimeter functional. The…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
In this work, we extend the concept of Robinson spaces to asymmetric dissimilarities, enhancing their applicability in representing and analyzing complex data. Within this generalized framework, we introduce two different problems that…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
Given a standard graded polynomial ring $R=k[x_1,...,x_n]$ over a field $k$ of characteristic zero and a graded $k$-subalgebra $A=k[f_1,...,f_m]\subset R$, one relates the module $\Omega_{A/k}$ of K\"ahler $k$-differentials of $A$ to the…
The purpose of the present thesis is to give a self-contained review of the solvable Lie algebra approach to supergravity problems related with S, T and U dualities. After recalling the general features of dualities in both Superstring…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
Duality is most often defined as a relationship between convex functions. If those functions are nonconvex, classical duality breaks down. Notwithstanding, we show that another kind of duality still exists, not between the functions…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real…
In this work we obtain sufficient conditions for the existence of bounded solutions of a resonant multi-point second-order boundary value problem, with a fully differential equation. The noninvertibility of the linear part is overcome by a…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We consider the problem of partitioning effectively a given symmetric (and irreflexive) rational relation R into two asymmetric rational relations. This problem is motivated by a recent method of embedding an R-independent language into one…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…