English
Related papers

Related papers: $\mathbb{N}$-polyregular functions arise from well…

200 papers

We study functions defined on a closed segment of the real line that belong to the class of Gonchar. We show that the graphs of such functions are pluripolar. We also discuss the generalizations of our result to functions defined on a…

Complex Variables · Mathematics 2009-10-30 Sevdiyor Imomkulov , Zafar Ibragimov

Difference balanced functions from $F_{q^n}^*$ to $F_q$ are closely related to combinatorial designs and naturally define $p$-ary sequences with the ideal two-level autocorrelation. In the literature, all existing such functions are…

Combinatorics · Mathematics 2013-10-01 Alexander Pott , Qi Wang

The notion of monogenic (or regular) functions, which is a correspondence of holomorphic functions, has been studied extensively in hypercomplex analysis, including quaternionic, octonionic, and Clifford analysis. Recently, the concept of…

Complex Variables · Mathematics 2026-05-19 Zhenghua Xu , Chao Ding , Haiyan Wang

A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

This work studies the question of learning probabilistic deterministic automata from language models. For this purpose, it focuses on analyzing the relations defined on algebraic structures over strings by equivalences and similarities on…

Formal Languages and Automata Theory · Computer Science 2024-12-16 Matías Carrasco , Franz Mayr , Sergio Yovine

A new classification of real functions and other related real objects defined within a compact interval is proposed. The scope of the classification includes normal real functions and distributions in the sense of Schwartz, referred to…

Mathematical Physics · Physics 2015-07-07 Jorge L. deLyra

This paper deals with both the higher order Tur\'an inequalities and the Laguerre inequalities for quasi-polynomial-like functions -- that are expressions of the form $f(n)=c_l(n)n^l+\cdots+c_d(n)n^d+o(n^d)$, where $d,l\in\mathbb{N}$ and…

Combinatorics · Mathematics 2023-10-24 Krystian Gajdzica

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

This paper presents a formalized analysis of the sigmoid function and a fully mechanized proof of the Universal Approximation Theorem (UAT) in Isabelle/HOL, a higher-order logic theorem prover. The sigmoid function plays a fundamental role…

Logic in Computer Science · Computer Science 2025-12-04 Dustin Bryant , Jim Woodcock , Simon Foster

We determine the most general form of a smooth function on Young diagrams, that is, a polynomial in the interlacing or multirectangular coordinates whose value depends only on the shape of the diagram. We prove that the algebra of such…

Combinatorics · Mathematics 2015-10-13 Jean-Christophe Aval , Valentin Féray , Jean-Christophe Novelli , Jean-Yves Thibon

We introduce and study two new relations between function spaces over measure spaces of infinite measure, motivated by the question of establishing compactness. The first relation captures the uniform decay of function (quasi-)norms ``at…

Functional Analysis · Mathematics 2025-11-25 Zdeněk Mihula , Maximilián Pándy

We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…

Computation and Language · Computer Science 2011-02-28 Victor Gluzberg

We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations…

Group Theory · Mathematics 2011-11-08 Alexander Olshanskii

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

In this paper we characterize left(right) ideals, bi-ideals and quasi-ideals of an ordered semigroup by an index $m$ and give some important interplays between these ideals. The concept of m-regularity of an ordered semigroups has been…

Group Theory · Mathematics 2022-03-22 Susmita Mallick

An important problem in combinatorial noncommutative algebra is to characterize the growth functions of finitely generated algebras (equivalently, semigroups, or hereditary languages). The growth function of every finitely generated,…

Rings and Algebras · Mathematics 2022-11-03 Be'eri Greenfeld

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

We begin by recalling the definition of nonnegative quasinearly subharmonic functions on locally uniformly homogeneous spaces. Recall that these spaces and this function class are rather general: among others subharmonic, quasisubharmonic…

Analysis of PDEs · Mathematics 2011-01-28 Juhani Riihentaus

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Combinatorics · Mathematics 2018-09-18 Daniele Bartoli , Kai-Uwe Schmidt

In this paper we suggest a typed compositional seman-tics for nominal compounds of the form [Adj Noun] that models adjectives as higher-order polymorphic functions, and where types are assumed to represent concepts in an ontology that…

Computation and Language · Computer Science 2008-02-10 Walid S. Saba