Related papers: Countable real analysis
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
Let $f : [0,1)\rightarrow [0,1)$ be a $2$-interval piecewise affine increasing map which is injective but not surjective. Such a map $f$ has a rotation number and can be parametrized by three real numbers. We make fully explicit the…
We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…
We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for…
We study function fields of curves over a base field $K$ which is either a global field or a large field having a separable field extension of degree divisible by $4$. We show that, for any such function field, Hilbert's 10th Problem has a…
The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
A new algorithm for analytic continuation of noisy quantum Monte Carlo (QMC) data from the Matsubara domain to real frequencies is proposed. Unlike the widely used maximum-entropy (MaxEnt) procedure, our method is linear with respect to…
We study the set of chords of a real-valued continuous function on [0,1] with f(0)=f(1)=0. We describe which chords may appear as isolated points and provide examples illustrating our characterization. Maximal Hopf sets are introduced and…
Considered will be properties of the set of real numbers $\Re$ generated by an operator that has form of an exponential function of Gelfond-Schneider type with rational arguments. It will be shown that such created set has cardinal number…
The sequence of the simple random walks on Hamming schemes $\{H(n, q)\}_{n=1}^{\infty}$ has a cutoff phenomenon for each integer $q$ greater than or equal to $3$. In this paper, for the sequence of simple random walks on Hamming schemes…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…
Let $\mathcal{H}$ be a complex Hilbert space and $T:\mathcal{H}\to \mathcal{H}$ be a contraction. Let $$A_nf=\frac{1}{n}\sum_{j=1}^nT^jf$$ for $f\in \mathcal{H}$. Let $(n_k)$ be a lacunary sequence, then there exists a constant $C_1>0$ such…
We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime $q$ and a finite abelian $q$-group…
Given the congruence lattice L of a finite algebra A with a Mal'cev term, we look for those sequences of operations on L that are sequences of higher commutator operations of expansions of A. The properties of higher commutators proved so…
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
Hilbert--Lie groups are Lie groups whose Lie algebra is a real Hilbert space whose scalar product is invariant under the adjoint action. These infinite-dimensional Lie groups are the closest relatives to compact Lie groups. Here we study…
Abstrct: In this note, by considering fractionally linear functions over a finite field and consequently developing an abstract sequence, we study some of its properties.