English
Related papers

Related papers: Classifying Functions via growth rates of repeated…

200 papers

In this paper we give an alternative exposition of a recent paper regarding the classification of growth rates of real functions. We take a different point of view, focussing on understanding possible growth rates between polynomial and…

Classical Analysis and ODEs · Mathematics 2026-05-19 Titus Hilberdink

We propose a notion of iterating functions $f:X^{k}\rightarrow X$ in a way that represents recurrence relations of the form $a_{n+k}=f(a_{n},a_{n+1},...,a_{n+k-1})$. We define a function as $n$-involutory when its $n$th iterate is the…

General Mathematics · Mathematics 2020-11-02 Suneil Parimoo

We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass…

Combinatorics · Mathematics 2018-08-14 Toufik Mansour , Howard Skogman , Rebecca Smith

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

Formal Languages and Automata Theory · Computer Science 2023-04-19 Thomas Colcombet , Gaëtan Douéneau-Tabot , Aliaume Lopez

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…

Logic · Mathematics 2022-01-13 J. P. Aguilera , F. Pakhomov , A. Weiermann

We shed some new light to the problem of characterizing those functions of several arguments that have a unique identification minor. The 2-set-transitive functions are known to have this property. We describe another class of functions…

Combinatorics · Mathematics 2016-11-22 Erkko Lehtonen

We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…

General Topology · Mathematics 2011-11-28 Alexey Ostrovsky

Temporal difference methods enable efficient estimation of value functions in reinforcement learning in an incremental fashion, and are of broader interest because they correspond learning as observed in biological systems. Standard value…

Machine Learning · Computer Science 2019-07-11 Brendan Bennett , Wesley Chung , Muhammad Zaheer , Vincent Liu

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

Logic in Computer Science · Computer Science 2017-08-17 Abhinav Aggarwal , Padam Kumar

We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…

Operator Algebras · Mathematics 2007-05-23 Frank Hansen , Jun Tomiyama

In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…

Number Theory · Mathematics 2025-12-08 Amit Kumar Basistha , Eugen J. Ionascu

A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…

Dynamical Systems · Mathematics 2012-07-03 Valerii Salov

In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…

Logic in Computer Science · Computer Science 2007-05-23 Aleksandar Ignjatovic , Arun Sharma

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

Combinatorics · Mathematics 2020-04-14 Ali Chouria , Vlad-Florin Drǎgoi , Jean-Gabriel Luque

We characterize the equality between ultradifferentiable function classes defined in terms of abstractly given weight matrices and in terms of the corresponding matrix of associated weight functions by using new growth indices. These…

Functional Analysis · Mathematics 2021-12-08 Javier Jiménez-Garrido , Javier Sanz , Gerhard Schindl

The classes of n-Wright-convex functions and n-Jensen-convex functions are compared with each other. It is shown that for any odd natural number $n$ the first one is the proper subclass of the second one. To reach this aim new tools…

Classical Analysis and ODEs · Mathematics 2012-01-20 Kazimierz Nikodem , Teresa Rajba , Szymon Wasowicz

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

Number Theory · Mathematics 2022-03-01 Joseph Burnett , Alex Taylor

In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…

Classical Analysis and ODEs · Mathematics 2019-08-05 Yasuhiro Fujita , Nao Hamamuki , Antonio Siconolfi , Norikazu Yamaguchi

We study the number of real rational degree n functions (considered up to linear fractional transformations of the independent variable) with a given set of 2n-2 distinct real critical values. We present a combinatorial reformulation of…

Algebraic Geometry · Mathematics 2007-05-23 B. Shapiro , A. Vainshtein

We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…

Computer Vision and Pattern Recognition · Computer Science 2013-05-30 Joscha Diehl
‹ Prev 1 2 3 10 Next ›