Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…

Let $X$ be a compact connected strongly pseudoconvex $CR$ manifold of real dimension $2n-1$ in $\mathbb{C}^{N}$. For $n\ge 3$, Yau solved the complex Plateau problem of hypersurface type by checking a bunch of Kohn-Rossi cohomology groups…

Recently the adaption problem of Information-Based Complexity (IBC) for linear problems in the randomized setting was solved in Heinrich (J. Complexity 82, 2024, 101821). Several papers treating further aspects of this problem followed.…

Let X be a K3 surface over a number field K. We prove that there exists a finite algebraic field extension L/K such that X has ordinary reduction at every non-archimedean place of L outside a density zero set of places.

We study irreducible mod p representations, valued in general reductive groups, of the Galois group of a number field. When the number field is totally real, we show that odd representations satisfying local ramification hypotheses and a…

We present an algorithm producing all rational functions $f$ with prescribed $n+1$ Taylor coefficients at the origin and such that $\|f\|_\infty\le 1$ and $\deg f\le k$ for every fixed $k\ge n$. The case where $k<n$ is also discussed.

Fix non-zero reals $\alpha_1,\ldots,\alpha_n$ with $n\ge 2$ and let $K$ be a non-empty open connected set in a topological vector space such that $\sum_{i\le n}\alpha_iK\subseteq K$ (which holds, in particular, if $K$ is an open convex cone…

In this paper, we study the existence and asymptotic properties of solutions to the following fractional Kirchhoff equation \begin{equation*} \left(a+b\int_{\mathbb{R}^{3}}|(-\Delta)^{\frac{s}{2}}u|^{2}dx\right)(-\Delta)^{s}u=\lambda…

In this paper we study biased random K-SAT problems in which each logical variable is negated with probability $p$. This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the…

Random linear network coding is a particularly decentralized approach to the multicast problem. Use of random network codes introduces a non-zero probability however that some sinks will not be able to successfully decode the required…

This paper presents new results allowing an unknown non-Gaussian positive matrix-valued random field to be identified through a stochastic elliptic boundary value problem, solving a statistical inverse problem. A new general class of…

We show that under some appropriate assumptions, every weak solution (e.g. energetic solution) to a given rate-independent system is of class SBV, or has finite jumps, or is even piecewise $C^1$. Our assumption is essentially imposed on the…

We consider entire solutions to $L u= f(u)$ in $\RR^2$, where $L$ is a general nonlocal operator with kernel $K(y)$. Under certain natural assumtions on the operator $L$, we show that any stable solution is a 1D solution. In particular, our…

In this work we study weighted total least squares problems on infinite dimensional spaces. We show that in most cases this problem does not admit a solution (except in the trivial case) and then, we consider a regularization on the…

Reinforcement learning (RL) promises a framework for near-universal problem-solving. In practice however, RL algorithms are often tailored to specific benchmarks, relying on carefully tuned hyperparameters and algorithmic choices. Recently,…

We study the first-order consequences of Ramsey's Theorem for $k$-colourings of $n$-tuples, for fixed $n, k \ge 2$, over the relatively weak second-order arithmetic theory $\mathrm{RCA}^*_0$. Using the Chong-Mourad coding lemma, we show…

We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…

The 3SUM problem asks if an input $n$-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three…