Related papers: Matching for generalised $\beta$-transformations
In this document we study the local connectivity of the sets whose elements are $m$-tuples of pairwise commuting normal matrix contractions. Given $\varepsilon>0$, we prove that there is $\delta>0$ such that for any two $m$-tuples of…
Suppose l=2m+1, m>0. We introduce m "theta-series", [1],...,[m], in Z/2[[x]]. It has been conjectured that the n for which the coefficient of x^n in 1/[i] is 1 form a set of density 0. This is probably always false, but in certain cases,…
For any positive integers $k,r,n$ with $r \leq \min\{k,n\}$, let $\mathcal{P}_{k,r,n}$ be the family of all sets $\{(x_1,y_1), \dots, (x_r,y_r)\}$ such that $x_1, \dots, x_r$ are distinct elements of $[k] = \{1, \dots, k\}$ and $y_1, \dots,…
A matching from a finite subset $A$ of an abelian group $G$ to another subset $B$ is a bijection $f : A \to B$ such that $af(a) \notin A$ for all $a \in A$. The study of matchings began in the 1990s and was motivated by a conjecture of E.…
We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with…
We consider the convergence of the eigenvalues to the support of the equilibrium measure in the $\beta$ ensemble models under a critical condition. We show a phase transition phenomenon, namely that, with probability one, all eigenvalues…
In this study, we investigate the form of solutions, stability character and asymptotic behavior of the following rational difference equation x_{n+1}=({\gamma}/(x_{n}(x_{n-1}+{\alpha})+\b{eta})), n=0,1,..., where the inital values x_{-1}…
A simple Parry number is a real number \beta>1 such that the R\'enyi expansion of 1 is finite, of the form d_\beta(1)=t_1...t_m. We study the palindromic structure of infinite aperiodic words u_\beta that are the fixed point of a…
We consider the two dimensional shrinking target problem in the beta dynamical system for general $\beta>1$ and with the general error of approximations. Let $f, g$ be two positive continuous functions. For any $x_0,y_0\in[0,1]$, define the…
In the classical $\beta$-ensembles of random matrix theory, setting $\beta = 2 \alpha/N$ and taking the $N \to \infty$ limit gives a statistical state depending on $\alpha$. Using the loop equations for the classical $\beta$-ensembles, we…
In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…
We prove a conjecture of H\'era on the dimension of unions of $k$-planes. Let $0<k \le d<n$ be integers, and $\beta\in[0,k+1)$. If $\mathcal{V}\subset A(k,n)$, with $\text{dim}(\mathcal{V})=(k+1)(d-k)+\beta$, then…
A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…
We prove the Pisot Conjecture for beta-substitutions: If beta is a Pisot number, the tiling dynamical system associated with the beta-substitution has pure discrete spectrum. As corollaries: (1) arithmetical coding of the hyperbolic…
As a generalization of Hausdorff's extension theorem of metrics, we prove an interpolation theorem of a family of metrics defined on closed subsets of metrizable spaces. As an application, we investigate typicality of subsets of moduli…
In this paper, we will introduce and study the lower moving digit mean $\underline{M}(x)$ and the upper moving digit mean $\overline{M}(x)$ of $x\in[0,1]$ in $p$-adic expansion, where $p\geq2$ is an integer. Moreover, the Hausdorff…
For any beta-shift $(X_\beta,\sigma)$ on two symbols, i.e., the symbolic coding of the beta-map for $1<\beta\leq2$, we give an exact formula for the Hausdorff dimension $\dim_{H} \Lambda_{\alpha(t)}$ as a function of $t\in\mathbb{R}$, where…
Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference stream of data (usually of large length). The matching can…
Given $\beta\in(1,2)$ and $x\in[0,\frac{1}{\beta-1}]$, a sequence $(\epsilon_{i})_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion for $x$ if $$x=\sum_{i=1}^{\infty}\frac{\epsilon_{i}}{\beta^{i}}.$$ In a recent article…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…