English
Related papers

Related papers: Bounded weight functions on regular languages and …

200 papers

A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…

Group Theory · Mathematics 2014-12-30 Moon Duchin , Michael Shapiro

We prove that one-relator groups are coherent, solving a well-known problem of Gilbert Baumslag. Our proof strategy is readily applicable to many classes of groups of cohomological dimension two. We show that fundamental groups of…

Group Theory · Mathematics 2025-02-05 Andrei Jaikin-Zapirain , Marco Linton

Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…

Logic in Computer Science · Computer Science 2025-03-04 Ali K. Caires-Santos , Maribel Fernández , Daniele Nantes-Sobrinho

Following Lusztig, we consider a Coxeter group $W$ together with a weight function $L$. This gives rise to the pre-order relation $\leq_{L}$ and the corresponding partition of $W$ into left cells. We introduce an equivalence relation on…

Representation Theory · Mathematics 2007-05-23 Meinolf Geck

We consider a kernel based harmonic analysis of "boundary," and boundary representations. Our setting is general: certain classes of positive definite kernels. Our theorems extend (and are motivated by) results and notions from classical…

Functional Analysis · Mathematics 2016-11-15 Palle Jorgensen , Feng Tian

In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring $\mathbb{Z}_{2^s}$ for broader classes of functions, namely, locally bounded functions and linear functions, and for weight…

Information Theory · Computer Science 2026-03-17 Gyanendra K. Verma , Abhay Kumar Singh

We introduce the notion of a C*-valued weight between two C*-algebras as a generalization of an ordinary weight on a C*-algebra and as a C*-version of operator valued weights on von Neumann algebras. Also, some form of lower semi-continuity…

funct-an · Mathematics 2008-02-03 Johan Kustermans

We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…

Formal Languages and Automata Theory · Computer Science 2017-12-08 Hamoon Mousavi

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…

Logic · Mathematics 2014-08-21 Marcel Jackson , Tim Stokes

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

Number Theory · Mathematics 2020-07-16 Nikos Frantzikinakis

We refine the infinitesimal Hecke algebra associated to a 2-reflection group into a $\Z/2\Z$-graded Lie algebra, as a first step towards a global understanding of a natural $\mathbbm{N}$-graded object. We provide an interpretation of this…

Representation Theory · Mathematics 2012-12-07 Ivan Marin

In this article, we treat stability conditions in the sense of King, Bridgeland and Bayer in a single framework. Following King, we begin with weight functions on a triangulated category, and consider increasingly specialised configurations…

Algebraic Geometry · Mathematics 2021-03-18 Jason Lo

We prove that if a weight is a Bekoll\'{e}-Bonami weight for some $q$ and it satisfies another simple condition that depends on $0 < p < \infty$, then the operator taking a function to its harmonic conjugate is bounded on the harmonic…

Complex Variables · Mathematics 2025-01-03 Timothy Ferguson

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

Computational Complexity · Computer Science 2019-08-29 Hans Raj Tiwary

In this paper a reduction and equivalence theorems for the boundedness of the composition of a quasilinear operator $T$ with the Hardy and Copson operators in weighted Lebesgue spaces are proved. New equivalence theorems are obtained for…

Classical Analysis and ODEs · Mathematics 2015-03-16 Amiran Gogatishvili , Rza Mustafayev

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

Formal Languages and Automata Theory · Computer Science 2024-10-09 Damien Pous , Jana Wagemaker

The theory of boundary regularity for $p$-harmonic functions is extended to unbounded open sets in complete metric spaces with a doubling measure supporting a $p$-Poincar\'e inequality, $1<p<\infty$. The barrier classification of regular…

Analysis of PDEs · Mathematics 2020-01-07 Anders Björn , Daniel Hansevi

For a fixed analytic function g on the unit disc, we consider the analytic paraproducts induced by g, which are formally defined by $T_gf(z)=\int_0^zf(\zeta)g'(\zeta)d\zeta$, $S_gf(z)=\int_0^zf'(\zeta)g(\zeta)d\zeta$, and…

Complex Variables · Mathematics 2023-11-13 Alexandru Aleman , Carme Cascante , Joan Fàbrega , Daniel Pascuas , José Ángel Peláez

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Computational Complexity · Computer Science 2013-09-24 Armin Hemmerling

A fundamental construction in formal language theory is the Myhill-Nerode congruence on words, whose finitedness characterizes regular language. This construction was generalized to functions from $\Sigma^*$ to $\mathbb{Z}$ by Colcombet,…

Formal Languages and Automata Theory · Computer Science 2024-09-13 Aliaume Lopez
‹ Prev 1 4 5 6 7 8 10 Next ›