Related papers: Variants of Solovay reducibility
By extending the classical quantitative approximation results for positive and linear operators in $L^{p}([0, 1]), 1\le p \le +\infty$ of Berens and DeVore in 1978 and of Swetits and Wood in 1983 to the more general case of sublinear,…
This paper constitutes a first attempt to do analysis with skew polynomials. Precisely, our main objective is to develop a theory of residues for skew rational functions (which are, by definition, the quotients of two skew polynomials). We…
From some observations on the linear differential operators occurring in the Lattice Green function of the d-dimensional face centred and simple cubic lattices, and on the linear differential operators occurring in the n-particle…
Markov Logic Networks (MLNs) define a probability distribution on relational structures over varying domain sizes. Many works have noticed that MLNs, like many other relational models, do not admit consistent marginal inference over varying…
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…
Semantic role labeling (SRL) aims at elaborating the meaning of a sentence by forming a predicate-argument structure. Recent researches depicted that the effective use of syntax can improve SRL performance. However, syntax is a complicated…
Selberg's central limit theorem states that the values of $\log|\zeta(1/2+i \tau)|$, where $\tau$ is a uniform random variable on $[T,2T]$, is distributed like a Gaussian random variable of mean $0$ and standard deviation…
Let ${X_1,...,X_n}$ be i.i.d. random observations. Let $\mathbb{S}=\mathbb{L}+\mathbb{T}$ be a $U$-statistic of order $k\ge2$ where $\mathbb{L}$ is a linear statistic having asymptotic normal distribution, and $\mathbb{T}$ is a…
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
Convolutional codes were originally conceived as vector subspaces of a finite-dimensional vector space over a field of Laurent series having a polynomial basis. Piret and Roos modeled cyclic structures on them by adding a module structure…
The paper is concerned with approximating the distribution of a sum W of n integer valued random variables Y_i, whose distributions depend on the state of an underlying Markov chain X. The approximation is in terms of a translated Poisson…
The impressive performance of recent language models across a wide range of tasks suggests that they possess a degree of abstract reasoning skills. Are these skills general and transferable, or specialized to specific tasks seen during…
This survey covers some of the recent developments on noncommutative motives and their applications. Among other topics, we compute the additive invariants of relative cellular spaces and orbifolds; prove Kontsevich's semi-simplicity…
The feasibility of extrapolation of completely monotone functions can be quantified by examining the worst case scenario, whereby a pair of completely monotone functions agree on a given interval to a given relative precision, but differ as…
Recent advances in large language models (LLMs) have made reasoning a central benchmark for evaluating intelligence. While prior surveys focus on efficiency by examining how to shorten reasoning chains or reduce computation, this view…
Reinforcement Learning with Verifiable Rewards (RLVR) has significantly improved large language model (LLM) reasoning in formal domains such as mathematics and code. Despite these advancements, LLMs still struggle with general reasoning…
Reynold's parametricity theory captures the property that parametrically polymorphic functions behave uniformly: they produce related results on related instantiations. In dependently-typed programming languages, such relations and…
This paper discusses a forgotten remark of Paul L\'evy (1935), determining the asymptotic distribution of sums of i.i.d. random variables with tails $cx^{-\alpha}\psi(\log x)$, where $0<\alpha<2$ and $\psi$ is a periodic function on…
We prove logarithmic Sobolev inequalities and concentration results for convex functions and a class of product random vectors. The results are used to derive tail and moment inequalities for chaos variables (in spirit of Talagrand and…
In this article, we study translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bijective correspondence. We assume that a translation can…