相关论文: Bounding finite-image sequences of length $\omega^…

Given a sequence $\mathbf{k} := (k_1,\ldots,k_s)$ of natural numbers and a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

We study pointwise convergence of the fractional Schr\"odinger means along sequences $t_n$ which converge to zero. Our main result is that bounds on the maximal function $\sup_{n} |e^{it_n(-\Delta)^{\alpha/2}} f| $ can be deduced from those…

Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the…

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

In this article, we design and analyze a Hybrid High-Order (HHO) finite element approximation for a class of strongly nonlinear boundary value problems. We consider an HHO discretization for a suitable linearized problem and show its…

Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $r$-graph on $n$ vertices in which every $k$ edges span more than $s$ vertices. Brown, Erd\H{o}s and S\'{o}s in 1973 conjectured that for every $k\geq 2$, the limit…

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

We introduce a notion of complexity for systems of linear forms, called sequential Cauchy-Schwarz complexity, which is parametrized by two positive integers $k,\ell$ and refines the notion of Cauchy-Schwarz complexity introduced by Green…

We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide…

The adjoint Fourier restriction inequality of Tomas and Stein states that the mapping $f\mapsto \widehat{f\sigma}$ is bounded from $\lt(S^2)$ to $L^4(\reals^3)$. We prove that there exist functions which extremize this inequality, and that…

Our main result is a new upper bound for the size of k-uniform, L-intersecting families of sets, where L contains only positive integers. We characterize extremal families in this setting. Our proof is based on the Ray-Chaudhuri--Wilson…

We prove optimal regularity results for solutions to linear kinetic Fokker-Planck equations in bounded domains. Our contributions are two-fold. First, we establish the sharp $C^{1/2}$ regularity for either diffuse reflection or prescribed…

We prove a deviation bound for the maximum of partial sums of functions of $\alpha$-dependent sequences as defined in Dedecker, Gou{\"e}zel and Merlev{\`e}de (2010). As a consequence, we extend the Rosenthal inequality of Rio (2000) for…

Inspired by Fujita's algebro-geometric result that complex projective space has maximal degree among all K-semistable complex Fano varieties, we conjecture that the height of a K-semistable metrized arithmetic Fano variety X of relative…

A function is boundedly finite-to-one if there is a natural number $k$ such that each point has at most $k$ inverse images. In this paper, we prove in $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of choice)…

We obtain finiteness theorems for algebraic cycles of small codimension on quadric fibrations X over curves over perfect fields k. For example, if k is finitely generated over Q and the fibration has odd relative dimension at least 11, then…

Motivated by the research on upper bounds on the rate of quantum transport for one-dimensional operators, particularly, the recent works of Jitomirskaya--Liu and Jitomirskaya--Powell and the earlier ones of Damanik--Tcheremchantsev, we…

Let $f^{(r)}(n;s,k)$ be the maximum number of edges in an $n$-vertex $r$-uniform hypergraph containing no $k$ edges on at most $s$ vertices. Brown, Erd\H{o}s and S\'os conjectured in 1973 that the limit $\lim_{n\rightarrow…

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…