English
Related papers

Related papers: Entire functions for which the escaping set is a s…

200 papers

We propose a new class of generative diffusion models, called functional diffusion. In contrast to previous work, functional diffusion works on samples that are represented by functions with a continuous domain. Functional diffusion can be…

Computer Vision and Pattern Recognition · Computer Science 2023-11-28 Biao Zhang , Peter Wonka

We study how the orbits of the singularities of the inverse of a meromorphic function prescribe the dynamics on its Julia set, at least up to a set of (Lebesgue) measure zero. We concentrate on a family of entire transcendental functions…

Dynamical Systems · Mathematics 2007-05-23 Jan-Martin Hemke

The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled…

Computational Complexity · Computer Science 2023-12-18 Bernard Berthomieu , Dmitry A. Zaitsev

Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…

Combinatorics · Mathematics 2013-02-12 Matthieu Josuat-Vergès , Jean-Christophe Novelli , Jean-Yves Thibon

Spider webs are incredible biological structures, comprising thin but strong silk filament and arranged into complex hierarchical architectures with striking mechanical properties (e.g., lightweight but high strength, achieving diverse…

Machine Learning · Computer Science 2023-04-12 Wei Lu , Nic A. Lee , Markus J. Buehler

Cyber-physical systems come with increasingly complex architectures and failure modes, which complicates the task of obtaining accurate system reliability models. At the same time, with the emergence of the (industrial) Internet-of-Things,…

Formal Languages and Automata Theory · Computer Science 2019-09-16 Alexis Linard , Doina Bucur , Marielle Stoelinga

We review theoretical approaches to the understanding of food webs. After an overview of the available food web data, we discuss three different classes of models. The first class comprise static models, which assign links between species…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 B. Drossel , A. J. McKane

Real complex systems are not rigidly structured; no clear rules or blueprints exist for their construction. Yet, amidst their apparent randomness, complex structural properties universally emerge. We propose that an important class of…

Let $\mathbb{F}_{p^{n}}$ be the finite field with $p^n$ elements and $\operatorname{Tr}(\cdot)$ be the trace function from $\mathbb{F}_{p^{n}}$ to $\mathbb{F}_{p}$, where $p$ is a prime and $n$ is an integer. Inspired by the works of…

Information Theory · Computer Science 2021-08-03 Xi Xie , Nian Li , Xiangyong Zeng , Xiaohu Tang , Yao Yao

Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…

Computational Physics · Physics 2022-06-22 Jonah M. Miller , Joshua C. Dolence , Daniel Holladay

We introduce two new classes of special subsets of the real line: the class of perfectly null sets and the class of sets which are perfectly null in the transitive sense. These classes may play the role of duals to the corresponding classes…

Logic · Mathematics 2018-02-16 Michał Korch , Tomasz Weiss

We derive completeness criteria for sequences of functions of the form $% f(x\lambda_{n})$, where $\lambda_{n}$ is the $nth$ zero of a suitably chosen entire function. Using these criteria, we construct systems of nonorthogonal…

Classical Analysis and ODEs · Mathematics 2009-11-11 Luis Daniel Abreu

An omitted value of a transcendental meromorphic function $f$ is called a Baker omitted value, in short \textit{bov} if there is a disk $D$ centered at the bov such that each component of the boundary of $f^{-1}(D)$ is bounded. Assuming…

Dynamical Systems · Mathematics 2021-07-06 Subhasis Ghora , Tarakanta Nayak , Satyajit Sahoo

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

Probability · Mathematics 2023-12-06 Jnaneshwar Baslingker , Biltu Dan

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

Logic · Mathematics 2025-10-14 Laurence Carassus , Massinissa Ferhoune

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane C have uniformly perfect attractor sets. Examples are given to illustrate the main theorem, as well as to indicate…

Complex Variables · Mathematics 2021-01-28 Kurt Falk , Rich Stankewitz

We give a general method for constructing examples of transcendental entire functions of given small order, which allows precise control over the size and shape of the set where the minimum modulus of the function is relatively large. Our…

Complex Variables · Mathematics 2020-11-20 Philip J. Rippon , Gwyneth M. Stallard

We prove that entire transcendental holomorphic functions with an omitted value have infinite entropy. A proof for general transcendental entire functions will be given in an upcoming paper.

Dynamical Systems · Mathematics 2018-08-07 Anna Miriam Benini , John Erik Fornæss , Han Peters

We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…

Number Theory · Mathematics 2008-06-11 Michael Coons , Peter Borwein

The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…

Logic in Computer Science · Computer Science 2017-01-11 C. T. Chong , Gordon Hoi , Frank Stephan , Daniel Turetsky