相关论文: Obstructions to uniformity, and arithmetic pattern…

We consider the the intersections of the complex nodal set of the analytic continuation of an eigenfunction of the Laplacian on a real analytic surface with the complexification of a geodesic. We prove that if the geodesic flow is ergodic…

Within the frame of a Group Approach to Quantization anomalies arise in a quite natural way. We present in this talk an analysis of the basic obstructions that can be found when we try to translate symmetries of the Newton equations to the…

We give a definition for Obstacle Problems with measure data and general obstacles. For such problems we prove existence and uniqueness of solutions and consistency with the classical theory of Variational Inequalities. Continuous…

Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…

We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or…

We study statistical properties of a family of maps acting in the space of integer valued sequences, which model dynamics of simple deterministic traffic flows. We obtain asymptotic (as time goes to infinity) properties of trajectories of…

We study the homogenization of an obstacle problem in a perforated domain. The holes are periodically distributed but have random size and shape. The capacity of the holes is assumed to be stationary ergodic. As in the periodic case, we…

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if the sequence is a realization of a…

Data Science and Machine learning have been growing strong for the past decade. We argue that to make the most of this exciting field we should resist the temptation of assuming that forecasting can be reduced to brute-force data analytics.…

Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…

Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…

A subshift with linear block complexity has at most countably many ergodic measures, and we continue of the study of the relation between such complexity and the invariant measures. By constructing minimal subshifts whose block complexity…

Interdiction problems ask about the worst-case impact of a limited change to an underlying optimization problem. They are a natural way to measure the robustness of a system, or to identify its weakest spots. Interdiction problems have been…

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

In this survey we review useful tools that naturally arise in the study of pointwise convergence problems in analysis, ergodic theory and probability. We will pay special attention to quantitative aspects of pointwise convergence phenomena…

Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a "good" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation.…

This paper considers an ergodic version of the bounded velocity follower problem, assuming that the decision maker lacks knowledge of the underlying system parameters and must learn them while simultaneously controlling. We propose…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

We identify a strong structural obstruction to Uniform Separation in constructive arithmetic. The mechanism is independent of semantic content; it emerges whenever two distinct evaluator predicates are sustained in parallel and inference…