Related papers: Bases for counting functions on free monoids and g…
We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…
We provide partial results towards a conjectural generalization of a theorem of Lubotzky-Mozes-Raghunathan for arithmetic groups (over number fields or function fields) that implies, in low dimensions, both polynomial isoperimetric…
A new generalisation of the notion of space, called "vectoid", is suggested in this work. Basic definitions, examples and properties are presented, as well as a construction of direct product of vectoids. Proofs of more complicated…
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean functions in terms of the minimum number of negations in…
Factors $\frac{X}{Y}$ in a free group $F$ with $Y$ normal in $X$ are considered. Precise results on the free structure of ${Y}$ relative to the free structure of ${X}$ when $\frac{X}{Y}$ is abelian are obtained. Some extensions and…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
It is shown that if A generates a bounded cosine operator function on a UMD space X, then i(-A)^{1/2} generates a bounded C_0-group. The proof uses a transference principle for cosine functions.
The notion of soft sets is introduced as a general mathematical tool for dealing with uncertainty. In this paper, we consider the concepts of soft compactness, countably soft compactness and obtain some results. We study some soft…
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.
In this paper we continue the study of free holomorphic functions on the unit ball of B(H)^n, where B(H) is the algebra of all bounded linear operators on a Hilbert space H. Several classical results from complex analysis have free…
This note contains a simple construction of complete sets of MUBs, using bent functions to write the new basis vectors as explicit linear combinations of the standard basis.
The paper is devoted to construction and investigation of some riggings of the $L^2$-space of Poisson white noise. A particular attention is paid to the existence of a continuous version of a function from a test space, and to the property…
In these lecture notes, we give a brief introduction to some elements of category theory. The choice of topics is guided by applications to functional programming. Firstly, we study initial algebras, which provide a mathematical…
We present here definitions and constructions basic for the theory of monoidal and tensor categories. We provide references to the original sources, whenever possible. Group-theoretical categories are used as examples
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…
A recently introduced numerical approach to quantum systems is analyzed. The basis of a Fock space is restricted and represented in an algebraic program. Convergence with increasing size of basis is proved and the difference between…
In which a review of the concept of countability is done in mathematics, subjecting review some of the theorems so far accepted, showing their inconsistency and also taking concrete elements on the countability of all the powers of the set…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
This manuscript presents a generalization of the structure of the null space of the Bezout matrix in the monomial basis, see [G. Heinig and K. Rost, Algebraic methods for toeplitz-like matrices and operators, 1984], to an arbitrary basis.…