Research
Research
Research
Research
34,821+ open-access research outputs.
We classify fillable contact structures on all negative-definite star-shaped plumbings. Along the way, we show that such Seifert fibred spaces admit a unique negative maximal twisting number, and comp…
We adapt the Ozsv\'ath-Szab\'o full path algorithm to every star-shaped graph and establish a correspondence between negative-twisting tight contact structures on any Seifert fibred space over $S^2$, …
We study Tur\'an-type extremal problems for distance graphs, motivated by work of Csikv\'ari, Bollob\'as, Tyomkyn, and Uzzell. We determine the maximum number of vertex pairs at distance three in an $…
We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal G$ be such a class, and for $H\in\mathcal G$ write $\Delta(H)$ and $d(H)$ for the maximum degree and av…
For a graph \(G\), let $avm(G)$ denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal matchings, and they as…
In this paper, we study the $L^p$-boundedness of Stein's square function $\mathfrak{S}^{\alpha}(\mathcal{L})$ associated with the sub-Laplacian $\mathcal{L}$ on M\'etivier group $G$. A key aspect of o…
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
We construct valuatively independent bases for the space of sections of an ample line bundle on a log Calabi--Yau pair over a discretely valued field and the space of regular functions on an affine CY…
The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimu…
In this paper we study a variant of the uncentred Hardy--Littlewood maximal operator on Damek--Ricci spaces in which balls are replaced by suitable half balls. Perhaps surprisingly, such modified maxi…
We construct a block bootstrap max-test for detecting the presence of significant predictors in a high dimensional setting, allowing for weakly dependent and heterogeneous (possibly non-stationary) da…
We present two complementary proofs that, if the lengths of $n$ sticks are sampled at random, then the probability that no $p+1$ sticks can form a $(p+1)$-sided polygon can be expressed as the product…
Motivated by an optimal-matching problem (Leighton-Shor) and the random-field Ising model (Aizenman-Wehr, Ding-Wirth), we consider a variational problem for graphs in $1+1$ dimension maximizing an act…
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possibl…
We study stochastic differential equations on the $d$-dimensional flat torus $\mathbb{T}^d$ with drift and perturbation coefficients in $L^{\infty}(\mathbb{T}^d;\mathbb{R}^d)$ and additive non-degener…
A skew Bollob\'{a}s system $\mathcal{P}=\{(A_i,B_i):1\leq i\leq m\}$ is a collection of pairs of disjoint subsets of $[n]$ such that $A_i\cap B_j\ne\emptyset$ for any $1\leq i<j\leq m$. Denote by $S_1…
A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of suc…
Let $K$ be a finite $p$-adic field with uniformiser $\pi$. In this paper we study the image of the logarithm attached to a Lubin-Tate series $[\pi](X)$ on the maximal ideal of so-called $\pi$-regular …
We develop a calculus for counting pseudoholomorphic disks with boundary in tropical Lagrangians contained in almost toric manifolds, using our previous work with Venugopalan. The results are mostly i…
We establish that $C^\infty$ three-dimensional flows with positive topological entropy admit only finitely many ergodic measures of maximal entropy, even when singularities (zero-velocity points) are …
Free open-access publishing with Google Scholar indexing.
Submission Guide →