Related papers: On properties of $B$-terms
The main purpose is to introduce the so-called bicomplex (bc)-frames which is a special extension to bicomplex infinite Hilbert spaces of the classical frames. The crucial result is the characterization of bc-frames in terms of their…
The notion of B-convexity for operator spaces, which a priori depends on a set of parameters indexed by $\Sigma$, is defined. Some of the classical characterizations of this geometric notion for Banach spaces are studied in this new…
We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is exponential in the number of clocks. Our method is polynomial:…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
A complete theory $T$ has the Schr\"oder-Bernstein property or simply the SB-property if any pair of elementarily bi-embeddable models are isomorphic. This property has been studied in the discrete first-order setting and can be seen as a…
We compute the Bernstein-Sato polynomial of $f$, a function which given a pair $(M,v)$ in $X = M_n(\mathbf{C}) \times \mathbf{C}^n$ tests whether $v$ is a cyclic vector for $M$. The proof includes a description of shift operators…
The B-operators (abbreviation for Brownian-type operators) are upper triangular 2x2 block matrix operators that satisfy certain algebraic constraints. The purpose of this paper is to characterize the weak, the strongand the uniform…
The \emph{Continuity Problem} is the question whether effective operators are continuous, where an effective operator $F$ is a function on a space of constructively given objects $x$, defined by mapping construction instructions for $x$ to…
We consider an {\em enforce operator} on impartial rulesets similar to the Muller Twist and the comply/constrain operator of Smith and St\u anic\u a, 2002. Applied to the rulesets A and B, on each turn the opponent enforces one of the…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…
We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and…
For a class of compactly supported windows we characterize the frame property for a Gabor system $\mts,$ for translation parameters $a$ belonging to a certain range depending on the support size. We show that the obstructions to the frame…
Given a symmetric linear transformation on a Hilbert space, a natural problem to consider is the characterization of its set of symmetric extensions. This problem is equivalent to the study of the partial isometric extensions of a fixed…
Self-composition provides a powerful theoretical approach to prove relational properties, i.e. properties relating several program executions, that has been applied to compare two runs of one or similar programs (in secure dataflow…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…
The mechanisms of comprehension during language processing remains an open question. Classically, building the meaning of a linguistic utterance is said to be incremental, step-by-step, based on a compositional process. However, many…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents two combinatorial algorithms based on Suffix automata or Directed…