相关论文: Iterating the recursively Mahlo operations
The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…
We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…
We study the minimality of almost every orbital branch of minimal iterated function systems (IFSs). We prove that this kind of minimality holds for forward and backward minimal IFSs generated by orientation-preserving homeomorphisms of the…
An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…
We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function $f:\mathbb R\to\mathbb R$, call a decreasing sequence $x_1>x_2>x_3>\cdots$ "$f$-bad" if…
This is the third article in a series of three dealing with the exploitation of speckle for imaging purposes. In complex media, a fundamental limit is the multiple scattering phenomenon that completely blurs the imaging process in depth.…
Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in abstract interpretation and also in model checking. Here we…
We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings,…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
Iterative learning to infer approaches have become popular solvers for inverse problems. However, their memory requirements during training grow linearly with model depth, limiting in practice model expressiveness. In this work, we propose…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
This paper deals with a proof theory for a theory of $\Pi_{N}$-reflecting ordinals using a system of ordinal diagrams. This is a sequel to the previous one(APAL 129)in which a theory for $\Pi_{3}$-reflection is analysed proof-theoretically.
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
This article shows that for unitary dual reductive pairs the first occurrence of theta lift of an irreducible cuspidal automorphic representation is irreducible. It also proves a refined tower property for theta lifts and the involutive…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
We consider the demixing problem of two (or more) high-dimensional vectors from nonlinear observations when the number of such observations is far less than the ambient dimension of the underlying vectors. Specifically, we demonstrate an…
We investigate whether transformers use their depth adaptively across tasks of increasing difficulty. Using a controlled multi-hop relational reasoning task based on family stories, where difficulty is determined by the number of…
We study the following combinatorial problem. Given a set of $n$ y-monotone \emph{wires}, a \emph{tangle} determines the order of the wires on a number of horizontal \emph{layers} such that the orders of the wires on any two consecutive…
We show tight upper and lower bounds for switching lemmas obtained by the action of random $p$-restrictions on boolean functions that can be expressed as decision trees in which every vertex is at a distance of at most $t$ from some leaf,…