Related papers: A generic characterization of Pol(C)
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
The rankable and compressible sets have been studied for more than a quarter of a century, ever since Allender [1] and Goldberg and Sipser [6] introduced the formal study of polynomial-time ranking. Yet even after all that time, whether the…
A regular operator T on a Hilbert C^*-module is defined just like a closed operator on a Hilbert space, with the extra condition that the range of (I+T^*T) is dense. Semiregular operators are a slightly larger class of operators that may…
We provide the solution to the normal ordering problem for powers and exponentials of two classes of operators. The first one consists of boson strings and more generally homogeneous polynomials, while the second one treats operators linear…
We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
We study generalized polar decompositions of densely defined, closed linear operators in Hilbert spaces and provide some applications to relatively (form) bounded and relatively (form) compact perturbations of self-adjoint, normal, and…
In this note we show that an unbounded regular operator $t$ on Hilbert $C^*$-modules over an arbitrary $C^*$ algebra $ \mathcal{A}$ has polar decomposition if and only if the closures of the ranges of $t$ and $|t|$ are orthogonally…
In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…
Discovering pattern sets or global patterns is an attractive issue from the pattern mining community in order to provide useful information. By combining local patterns satisfying a joint meaning, this approach produces patterns of higher…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
An expansive, monotone operator is dominating; if it is also idempotent it is a closure operator. Although they have distinct properties, these two kinds of discrete operators are also intertwined. Every closure operator is dominating;…
Polynomial multiplication is known to have quasi-linear complexity in both the dense and the sparse cases. Yet no truly linear algorithm has been given in any case for the problem, and it is not clear whether it is even possible. This…
For a tuple of $k+1$ convex polytopes $(A, B,\ldots, B)$ we solve the so-called effective membership problem, i.e. for a tuple $f=(f_1,\ldots, f_k)$ of polynomials satisfying some certain properties of generality and having Newton polytope…
In this paper we focus on functions of the form $A^n\rightarrow \mathcal{P}(B)$, for possibly different arbitrary non-empty sets $A$ and $B$, and where $\mathcal{P}(B)$ denotes the set of all subsets of $B$. These mappings are called…
We study the $c$-vectors, $g$-vectors, and $F$-polynomials for generalized cluster algebras satisfying a normalization condition and a power condition recovering classical recursions and separation of additions formulas. We establish a…
In language learning in the limit, the most common type of hypothesis is to give an enumerator for a language. This so-called $W$-index allows for naming arbitrary computably enumerable languages, with the drawback that even the membership…