Related papers: Low Ambiguity in Strong, Total, Associative, One-W…

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

Let $U$ be an open set in $\mathbb{R}^d$. A continuous function $f\colon U \to \mathbb{R}$ is strongly nowhere differentiable if and only if for each $\gamma\in(0,1]$ and for each unit speed $C^{1,\gamma}$ curve $c\colon [a,b] \to U$, the…

Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…

We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…

Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…

For a transcendental entire function, a partial affirmative answer to Baker's question on the boundedness of its Fatou components is given. In addition, we have addressed Wang's question on Fej\'er gaps. Certain results about functions with…

In formal language theory, several different models characterize regular languages, such as finite automata, congruences of finite index, or monadic second-order logic (MSO). Moreover, several fragments of MSO have effective…

It is shown that harmonic functions on some subsets, subharmonic and coinciding everywhere outside of these sets, actually coincide everywhere.

Motivated by open questions in the papers " Refinements and sharpenings of some double inequalities for bounding the gamma function" and "Complete monotonicity and monotonicity of two functions defined by two derivatives of a function…

Akcoglu and Suchaston proved the following result: Let $T:L^1(X,{\cf},\m)\to L^1(X,{\cf},\m)$ be a positive contraction. Assume that for $z\in L^1(X,{\cf},\m)$ the sequence $(T^nz)$ converges weakly in $L^1(X,{\cf},\m)$, then either…

This article establishes a real-variable argument for Zygmund's theorem on almost everywhere convergence of strong arithmetic means of partial sums of Fourier series on $\mathbb{T}$, up to passing to a subsequence. Our approach extends to,…

Let $\Sigma_1,\ldots,\Sigma_k$ be finite alphabets, and let $\mu$ be a distribution over $\Sigma_1 \times \dots \times \Sigma_k$ in which the probability of each atom is at least $\alpha$. We prove that if $\mu$ does not admit Abelian…

We provide a characterization of discrete sets $\Lambda \subset \mathbb{R}$ that admit a function whose $\Lambda$-translates are complete in the Hardy space $H^1(\mathbb{R})$. In particular, we show that such a set cannot be uniformly…

We show that the set of Lebesgue integrable functions in $[0,1]$ which are nowhere essentially bounded is spaceable, improving a result from [F. J. Garc\'{i}a-Pacheco, M. Mart\'{i}n, and J. B. Seoane-Sep\'ulveda. \textit{Lineability,…

In the 1950s L. Schwartz proved his famous impossibility result: for every k in N there does not exist a differential algebra (A,+,*,D) in which the distributions can be embedded, where D is a linear operator that extends the distributional…

A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform…

Inspired by the idea of blurring the exponential function, we define blurred variants of the $j$-function and its derivatives, where blurring is given by the action of a subgroup of $\rm{GL}_2(\mathbb{C})$. For a dense subgroup (in the…

In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only one share. By applying…

We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently…

A function is boundedly finite-to-one if there is a natural number $k$ such that each point has at most $k$ inverse images. In this paper, we prove in $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of choice)…