English
Related papers

Related papers: Finite random iterated function systems do not alw…

200 papers

Many models of population dynamics are formulated as deterministic iterated maps although real populations are stochastic. This is justifiable in the limit of large population sizes, as the stochastic fluctuations are negligible then.…

Populations and Evolution · Quantitative Biology 2025-09-16 Snehal M. Shekatkar

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

Group Theory · Mathematics 2013-01-16 Desmond Cummins

Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…

Systems and Control · Electrical Eng. & Systems 2026-03-25 Hernan Haimovich , Jose L. Mancilla-Aguilar

The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…

funct-an · Mathematics 2008-02-03 Elijah Liflyand

In 2017, Zhang et al. proposed a question (not open problem) and two open problems in [IEEE TIT 63 (8): 5336--5349, 2017] about constructing bent functions by using Rothaus' construction. In this note, we prove that the sufficient…

Information Theory · Computer Science 2025-02-17 Fei Guo , Zilong Wang , Guang Gong

One reason why standard formulations of the central limit theorems are not applicable in high-dimensional and non-stationary regimes is the lack of a suitable limit object. Instead, suitable distributional approximations can be used, where…

Statistics Theory · Mathematics 2024-12-20 Fabian Mies

In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…

Numerical Analysis · Mathematics 2020-07-13 Ben Adcock , Daan Huybrechs

Ackermann's function can be expressed using an iterative algorithm, which essentially takes the form of a term rewriting system. Although the termination of this algorithm is far from obvious, its equivalence to the traditional recursive…

Logic in Computer Science · Computer Science 2022-10-14 Lawrence C Paulson

This paper questions the generally accepted assumption that one can make a random choice that is independent of the rest of the universe. We give a general description of any setup that could be conceived to generate random numbers. Based…

Quantum Physics · Physics 2016-08-31 Hitoshi Inamori

Mixture models are one of the most widely used statistical tools when dealing with data from heterogeneous populations. This paper considers the long-standing debate over finite mixture and infinite mixtures and brings the two modelling…

Methodology · Statistics 2019-04-23 Raffaele Argiento , Maria De Iorio

The aim of this paper is to establish some results regarding Infinite Iterated Function Systems with the help of the Tarski-Kantorovitch fixed-point principles for maps on partially ordered sets. To this end we introduce two new classes of…

Dynamical Systems · Mathematics 2021-10-12 Bogdan-Alexandru Luchian

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Computational Complexity · Computer Science 2025-02-11 Tejas Nareddy , Abhishek Mishra

The computation of two Bayesian predictive distributions which are discrete mixtures of incomplete beta functions is considered. The number of iterations can easily become large for these distributions and thus, the accuracy of the result…

Statistics Theory · Mathematics 2007-06-13 Jacques Poitevineau , Bruno Lecoutre

In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained. It is shown that the transition complexity…

Formal Languages and Automata Theory · Computer Science 2010-08-11 Yuan Gao , Kai Salomaa , Sheng Yu

Almost surely, the difference between the randomness deficiencies of two infinite sequences will be unbounded with respect to repeated iterations of the shift operator.

Computational Complexity · Computer Science 2024-08-28 Samuel Epstein

An exact expression for the finite frequency response of open classical systems coupled to reservoirs is obtained. The result is valid for any conserved current. No assumption is made about the reservoirs apart from thermodynamic…

Statistical Mechanics · Physics 2015-05-27 Onuttom Narayan

In this paper, we show that the methods of mathematical statistical physics can be successfully applied to random fields in finite volumes. As a result, we obtain simple necessary and sufficient conditions for the existence and uniqueness…

Probability · Mathematics 2022-11-23 Linda A. Khachatryan , Boris S. Nahapetian

In this paper, we consider Bayesian hypothesis testing for the balanced one-way random effects model. A special choice of the prior formulation for the ratio of variance components is shown to yield an explicit closed-form Bayes factor…

Methodology · Statistics 2013-02-27 Min Wang , Xiaoqian Sun

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…

Formal Languages and Automata Theory · Computer Science 2013-10-04 Victor Marsault , Jacques Sakarovitch

In this paper we consider a class of conjugate equations, which generalizes de Rham's functional equations. We give sufficient conditions for existence and uniqueness of solutions under two different series of assumptions. We consider…

Classical Analysis and ODEs · Mathematics 2026-04-15 Kazuki Okamura