Related papers: Combinatorics of linear iterated function systems …

In this paper we consider Iterated Function Systems (IFS) on the real line consisting of continuous piecewise linear functions. We assume some bounds on the contraction ratios of the functions, but we do not assume any separation condition.…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

Absence of (complex) zeros property is at the heart of the interpolation method developed by Barvinok \cite{barvinok2017combinatorics} for designing deterministic approximation algorithms for various graph counting and computing partition…

We establish the following Hilbert-space analogue of the Gleason-Kahane-\.Zelazko theorem. If $\mathcal{H}$ is a reproducing kernel Hilbert space with a normalized complete Pick kernel, and if $\Lambda$ is a linear functional on…

We construct a family of planar self-affine carpets with overlaps using lower triangular matrices in a way that generalizes the original Gatzouras--Lalley carpets defined by diagonal matrices. Assuming the rectangular open set condition,…

This paper is an exposition, with some new applications, of our results on the growth of entropy of convolutions. We explain the main result on $\mathbb{R}$, and derive, via a linearization argument, an analogous result for the action of…

Let ${\bf A} = (A_1, \dots, A_m)$ be an $m$-tuple of bounded linear operators acting on a Hilbert space ${\cal H}$. Their joint $(p,q)$-matricial range $\Lambda_{p,q}({\bf A})$ is the collection of $(B_1, \dots, B_m) \in {\bf M}_q^m$, where…

Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension of the program, and polynomial in the size of the ILP. That…

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

This paper examines thresholds for certain properties of the attractor of a general one-parameter affine family of iterated functions systems. As the parameter increases, the iterated function system becomes less contractive, and the…

A superposition of a matrix ensemble refers to the ensemble constructed from two independent copies of the original, while a decimation refers to the formation of a new ensemble by observing only every second eigenvalue. In the cases of the…

We consider the family $\mathrm{MC}_d$ of monic centered polynomials of one complex variable with degree $d \geq 2$, and study the map $\widehat{\Phi}_d:\mathrm{MC}_d\to \widetilde{\Lambda}_d \subset \mathbb{C}^d / \mathfrak{S}_d$ which…

In the goundbreaking paper [BD11] (which opened a wide avenue of research regarding unlikely intersections in arithmetic dynamics), Baker and DeMarco prove that for the family of polynomials $f_\lambda(x):=x^d+\lambda$ (parameterized by…

In this paper, we investigate the Hausdorff dimension of the invariant measures of the iterated function system (IFS) $\{\alpha x, \beta x, \gamma x+(1-\gamma)\}$. We provide an "almost every" type result by a direct application of the…

Given a self-adjoint matrix $A$ and an index $h$ such that $\lambda_h(A)$ lies in a cluster of eigenvalues of $A$, we introduce the novel class of $\Lambda$-admissible subspaces of $A$ of dimension $h$. First, we show that the low-rank…

We investigate the existence and multiplicity of solutions for a class of generalized coupled system involving poly-Laplacian and a parameter $\lambda$ on finite graphs. By using mountain pass lemma together with cut-off technique, we…

Let $p_1,...,p_L\in Z[x_1,...,x_d]$ be non-constant polynomials with zero constant term. The ergodic theoretical proofs of the polynomial and the IP-polynomial Szemeredi theorems as well as some of the ergodic-theoretical and combinatorial…

We study the best approximation problem: \[ \displaystyle \min_{\alpha\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m \alpha_j \Gamma_j ({\bf x}_i) \right|. \] Here: $\Gamma:=\left\{\Gamma_1,...,\Gamma_m\right\}$ is a list of…

In this paper, we consider self-adjoint difference equations of the form -\Delta(a_{n-1}\Delta y_{n-1})+b_{n}y_{n}=\lambda y_{n},n=0,1,...\label{eq:abstract} where $a_{n-1}>0$ for all $n\ge0$ and $b_{n}$ are real and $\lambda$ is complex.…

We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let $X$ be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension $d$. Informally, the theorem states that if $X$…