Related papers: Logarithmic Space and Permutations
We study function spaces that are related to square-integrable, irreducible, unitary representations of several low-dimensional nilpotent Lie groups. These are new examples of coorbit theory and yield new families of function spaces on…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
A general discussion of the conformal Ward identities is presented in the context of logarithmic conformal field theory with conformal Jordan cells of rank two. The logarithmic fields are taken to be quasi-primary. No simplifying…
We give a spectral theorem for unital representations of Hermitian commutative unital *-algebras by possibly unbounded operators in a pre-Hilbert space. A better result is known for the case in which the *-algebra is countably generated.
The use of programming languages can wax and wane across the decades. We examine the split-apply- combine pattern that is common in statistical computing, and consider how its invocation or implementation in languages like MATLAB and APL…
Logic programming languages present clear advantages in terms of declarativeness and conciseness. However, the ideas of logic programming have been met with resistance in other programming communities, and have not generally been adopted by…
This paper is a contribution to the theory of dynamical sampling. Our purpose is twofold. We first consider representations of sequences in a Hilbert space in terms of iterated actions of a bounded linear operator. This generalizes recent…
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
In this monograph, we study complexity classes that are defined using $O(\log n)$-space bounded non-deterministic Turing machines. We prove salient results of Computational Complexity in this topic such as the Immerman-Szelepcsenyi Theorem,…
The paper extends existing Lie algebra representation theory related to Lie algebra gradings. The notion of a representation compatible with a given grading is defined and applied to finite-dimensional representations of $sl(n,\mathbb{C})$…
This article introduces several new relations among related Hilbert space operators. In particular, we prove some L\"{o}ewner partial orderings among $T, |T|, \mathcal{R}T, \mathcal{I}T, |T|+|T^*|$ and many other related forms, as a new…
Quantum Mechanics and Signal Processing in the line R, are strictly related to Fourier Transform and Weyl-Heisenberg algebra. We discuss here the addition of a new discrete variable that measures the degree of the Hermite functions and…
We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the {\pi}-calculus as formulas. We provide correctness criterion,…
Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…
We prove that $t$-dependent Schr\"odinger equations on finite-dimensional Hilbert spaces determined by $t$-dependent Hermitian Hamiltonian operators can be described through Lie systems admitting a Vessiot--Guldberg Lie algebra of K\"ahler…
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps (but with immutable stack variables). In particular, we…
In order to work with mathematical content in computer systems, it is necessary to represent it in formal languages. Ideally, these are supported by tools that verify the correctness of the content, allow computing with it, and produce…
Humans are believed to perceive numbers on a logarithmic mental number line, where smaller values are represented with greater resolution than larger ones. This cognitive bias, supported by neuroscience and behavioral studies, suggests that…
We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with…
In the field of natural language processing (NLP), continuous vector representations are crucial for capturing the semantic meanings of individual words. Yet, when it comes to the representations of sets of words, the conventional…