English
Related papers

Related papers: What lies between polynomial and exponential growt…

200 papers

Expansions of abelian categories are introduced. These are certain functors between abelian categories and provide a tool for induction/reduction arguments. Expansions arise naturally in the study of coherent sheaves on weighted projective…

Representation Theory · Mathematics 2010-09-20 Xiao-Wu Chen , Henning Krause

It is well-known that biological phenomena are emergent. Emergent phenomena are quite interesting and amazing. However, they are difficult to be understood. Due to this difficulty, we propose a theory to describe emergence based on a…

Category Theory · Mathematics 2018-10-30 Giuliano Gadioli La Guardia , Pedro Jeferson Miranda

From the integration of non-symmetrical hyperboles, a one-parameter generalization of the logarithmic function is obtained. Inverting this function, one obtains the generalized exponential function. We show that functions characterizing…

Data Analysis, Statistics and Probability · Physics 2010-10-19 Alexandre Souto Martinez , Rodrigo Silva Gonzalez , Cesar Augusto Sangaletti Tercariol

An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…

Optimization and Control · Mathematics 2014-03-13 Andreas H. Hamel , Carola Schrage

A two-parameter deformation of the Touchard polynomials, based on the NEXT $q$-exponential function of Tsallis, defines two statistics on set partitions. The generating function of classical Touchard polynomials is a composition of two…

Combinatorics · Mathematics 2022-08-10 Orli Herscovici

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

History and Overview · Mathematics 2015-04-23 Piotr Błaszczyk

We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…

Combinatorics · Mathematics 2024-04-24 Shi-Mei Ma , Toufik Mansour , Jean Yeh , Yeong-Nan Yeh

We introduce and investigate the algebras of steadily growing length, that is the class of algebras, where the length is bounded by a linear function of the dimension. In particular we show that Malcev algebras belong to this class and…

Rings and Algebras · Mathematics 2022-03-08 Alexander Guterman , Dmitry Kudryavtsev

Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…

Number Theory · Mathematics 2015-06-22 Charles L. Samuels

The notion of a root functional of polynomials is a generalization of the notion of a root for a multiple root. A root functional is a linear functional that is defined on a polynomial ring and annuls the ideal of a system of polynomials. A…

Commutative Algebra · Mathematics 2008-05-28 Timur R. Seifullin

Evolving network models under a dynamic growth rule which comprises the addition and deletion of nodes are investigated. By adding a node with a probability $P_a$ or deleting a node with the probability $P_d=1-P_a$ at each time step, where…

Physics and Society · Physics 2011-08-09 Ke Deng , Ke Hu , Yi Tang

This article answers the question of V.M. Buchstaber about the growth function of a particular $n$-valued group. This question is closely related to discrete integrable systems. In this paper, we will find a formula for the growth function…

Dynamical Systems · Mathematics 2023-09-26 M. Chirkov

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

Rings and Algebras · Mathematics 2014-06-10 Jean-Luc Marichal , Bruno Teheux

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

Combinatorics · Mathematics 2007-05-23 M. H. Albert , M. D. Atkinson , Robert Brignall

We construct an uncountable family of finitely generated groups of intermediate growth, with growth functions of new type. These functions can have large oscillations between lower and upper bounds, both of which come from a wide class of…

Group Theory · Mathematics 2011-08-02 Martin Kassabov , Igor Pak

Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and…

Combinatorics · Mathematics 2008-06-24 Miloud Mihoubi

Complex linear differential equations with entire coefficients are studied in the situation where one of the coefficients is an exponential polynomial and dominates the growth of all the other coefficients. If such an equation has an…

Complex Variables · Mathematics 2021-07-01 Janne Heittokangas , Katsuya Ishizaki , Kazuya Tohge , Zhi-Tao Wen

Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $\lambda$-calculus, the process representations yield (at best) non-extensional $\lambda $-theories (i.e., $\beta$…

Logic in Computer Science · Computer Science 2025-09-17 Ken Sakayori , Davide Sangiorgi

The main purpose of this work is to prove characterization theorems for generalized moment functions on groups. According one of the main results these are exponential polynomials that can be described with the aid of complete (exponential)…

Classical Analysis and ODEs · Mathematics 2021-09-08 Żywilla Fechner , Eszter Gselmann , László Székelyhidi

We improve and refine a method for certifying that the values' sizes computed by an imperative program will be bounded by polynomials in the program's inputs' sizes. Our work ''tames'' the non-determinism of the original analysis, and…

Logic in Computer Science · Computer Science 2021-07-05 Clément Aubert , Thomas Rubiano , Neea Rusch , Thomas Seiller