Related papers: Bounded weight functions on regular languages and …
Various convergence results for the Bergman kernel of the Hilbert space of all polynomials in \C^{n} of total degree at most k, equipped with a weighted norm, are obtained. The weight function is assumed to be C^{1,1}, i.e. it is…
A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they…
We interpret a counterexample to Hilbert's 14th problem by S. Kuroda geometrically in two ways: As ring of regular functions on a smooth rational quasiprojective variety over any field K of characteristic 0, and, in the special case where K…
For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
In this paper we study the boundedness of Bergman projectors on weighted Bergman spaces on homogeneous Siegel domains of Type II. As it appeared to be a natural approach in the special case of tube domains over irreducible symmetric cones,…
Assuming that $S$ is the space of functions of regular variation, $\omega\in S$, $0< p<\infty$, a function $f$ holomorphic in $B^n$ is said to be of Besov space $B_p(\omega)$ if $$\|f\|^p_{B_p(\omega )}=\int_{B^n}…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
We establish the theorems that give necessary and sufficient conditions for an arbitrary function defined in the unit disk of complex plane in order to has boundary values along classes of equivalencies of simple curves. Our results…
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…
Sifted colimits (those that commute with finite products in sets) play a major role in categorical universal algebra. For example, varieties of (many-sorted) algebras are precisely the free cocompletions under sifted colimits of…
We introduce the regular product for Cullen-regular quaternionic functions in a manner that does not depend upon a representation in power series but upon another, weaker kind of representation. The special case when the functions are…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
This paper studies three different ways to assign weights to the lattice points of a convex polytope and discusses the algebraic and combinatorial properties of the resulting weighted Ehrhart functions and their generating functions and…
Via the new weight $A_{\vec p}^{\theta }(\varphi )$, the authors introduce a new class of multilinear square operators. The boundedness on the weighted Lebesgue space and the weighted Morrey space is obtained, respectively. Our results…
We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
In this work we study boundedness of Littlewood-Paley-Stein square func- tions associated to multilinear operators. We prove weighted Lebesgue space bounds for square functions under relaxed regularity and cancellation conditions that are…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…