Related papers: Sparse matrices describing iterations of integer-v…
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Connections with sparse signal recovery allows for the use of…
This paper studies an asymptotic framework for conducting inference on parameters of the form $\phi(\theta_0)$, where $\phi$ is a known directionally differentiable function and $\theta_0$ is estimated by $\hat \theta_n$. In these settings,…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
We propose a new method for computing the $\varphi$-functions of large sparse matrices with low rank or fast decaying singular values. The key is to reduce the computation of $\varphi_{\ell}$-functions of a large matrix to…
The $3x+1$ Problem asks if whether for every natural number $n$, there exists a finite number of iterations of the piecewise function $$f(2n)=n, \quad f(2n-1)=6n-2, $$ with an iterate equal to the number $1$, or in other words, every…
This paper examines level sets of functions of the form $f(x)=\sum_{n=0}^\infty \frac{r_n}{2^n}\phi(2^n x)$, where phi(x) is the distance from x to the nearest integer, and r_n equals 1 or -1 for each n. Such functions are referred to as…
For a complex $n$-by-$n$ matrix $A$, the numerical range $F(A)$ is the range of the map $f_A(x) = x^*A x$ acting on the unit sphere in $\C^n$. We ask whether the multivalued inverse numerical range map $f_A^{-1}$ has a continuous…
Euler function $\phi(n)$ is the number of positive integers less than $n$ and relatively prime to $n$. Suppose that $\phi^1(n)=\phi(n)$ and $\phi^i(n)=\phi(\phi^{i-1}(n))$. Let $A\subseteq \mathbb{N}$, and $A_{\phi}=\{ \phi^k(n)| n\in A ,…
Moran-type iterated function systems (Moran-type IFS or MIFS) are defined by a sequence of iterated function systems, and their basic theoretical framework is established. We define Moran-type attractors and invariant probability measures…
An iterative square root of a function $f$ is a function $g$ such that $g(g(\cdot))=f(\cdot)$. We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. This is used to prove that…
This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…
A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…
Let $n$ be a positive integer. An $n$-cycle of linear mappings is an $n$-tuple $(u_1,\dots,u_n)$ of linear maps $u_1 \in \mathrm{Hom}(U_1,U_2),u_2 \in \mathrm{Hom}(U_2,U_3),\dots,u_n \in \mathrm{Hom}(U_n,U_1)$, where $U_1,\dots,U_n$ are…
Motivated by recent progress in operator representation of frames, we investigate the frames of the form $ \{T^n \varphi\}_{n\in I}$ for $ I=\mathbb{N}, \mathbb{Z} $, and answer questions about representations, perturbations and frames…
For a positive integer $n$ let $\mathcal{X}_n$ be either the algebra $M_n$ of $n \times n$ complex matrices, the set $N_n$ of all $n \times n$ normal matrices, or any of the matrix Lie groups $\mathrm{GL}(n)$, $\mathrm{SL}(n)$ and…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
Let $f$ be a $r\times m$-matrix of holomorphic functions that is generically surjective. We provide explicit integral representation of holomorphic $\psi$ such that $\phi=f\psi$, provided that $\phi$ is holomorphic and annihilates a certain…
In this article, we study the fluctuation of linear eigenvalue statistics of symmetric circulant matrices $(SC_n)$ with independent entries which satisfy some moment conditions. We show that $\frac{1}{\sqrt{n}} \Tr \phi(SC_n)$ obey the…
We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…
We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindromic circuits. We precisely determine which self-inverse…