相关论文: Shrinking targets and recurrent behaviour for forw…

For any coloured operad R, we prove a Fa\`a di Bruno formula for the `connected Green function' in the incidence bialgebra of R. This generalises on one hand the classical Fa\`a di Bruno formula (dual to composition of power series),…

We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x…

Let $(X,T,\mu,d)$ be a metric measure-preserving system. If $B(x,r_n(x))$ is a sequence of balls such that, for each $n$, the measure of $B(x,r_n(x))$ is constant, then we obtain a self-norming CLT for recurrence for systems satisfying a…

We define directional recurrence for infinite measure preserving Z^d actions both intrinsically and via the unit suspension flow and prove that the two definitions are equivalent. We study the structure of the set of recurrent directions…

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

In these three lectures we will discuss some fundamental aspects of the theory of self-adjoint extensions of the covariant Laplace-Beltrami and Dirac operators on compact Riemannian manifolds with smooth boundary emphasizing the relation…

Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…

A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…

Many problems in statistical learning, imaging, and computer vision involve the optimization of a non-convex objective function with singularities at the boundary of the feasible set. For such challenging instances, we develop a new…

We consider the nonparametric regression problem with multiple predictors and an additive error, where the regression function is assumed to be coordinatewise nondecreasing. We propose a Bayesian approach to make an inference on the…

Bounds consistency is usually enforced on continuous constraints by first decomposing them into binary and ternary primitives. This decomposition has long been shown to drastically slow down the computation of solutions. To tackle this,…

We investigate the learning dynamics of shallow ReLU neural networks on the unit sphere \(S^2\subset\mathbb{R}^3\) in polar coordinates \((\tau,\phi)\), considering both fixed and trainable neuron directions \(\{w_i\}\). For fixed weights,…

In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation. This result shows that for a family of limsup sets,…

Given a random sequence of holomorphic maps $f_1,f_2,f_3,...$ of the unit disk $\Delta$ to a subdomain $X$, we consider the compositions $$F_n=f_1 \circ f_{2} \circ ... f_{n-1} \circ f_n.$$ The sequence $\{F_n\}$ is called the {\em iterated…

We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…

We study the factorization and monotonicity method for inverse acoustic scattering problems. Firstly, we give a new general functional analysis theorem for the monotonicity method. Comparing with the factorization method, the general…

In this paper, we derive some new combinatorial inequalities by applying well known real analytic results like H\"{o}lder's inequality, Young's inequality, and Minkowiski's inequality to the recursively defined sequence $f_n$ of functions…

We construct bisymmetric, strictly increasing binary operations on real intervals which are not continuous. This answers a natural question in the theory of bisymmetric and mean-type operations by showing that continuity may fail for…

Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…

A high dimensional dynamical system is often studied by experimentalists through the measurement of a relatively low number of different quantities, called an observation. Following this idea and in the continuity of Boshernitzan's work,…