Related papers: Degrees bounding principles and universal instance…

We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected.…

We obtain bounds for the number of variables required to establish Hasse principles, both for existence of solutions and for asymptotic formulae, for systems of additive equations containing forms of differing degree but also multiple forms…

We establish doubly-exponential degree bounds for Gr\"obner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of algebras considered here includes commutative polynomial…

We consider statistical tasks in high dimensions whose loss depends on the data only through its projection into a fixed-dimensional subspace spanned by the parameter vectors and certain ground truth vectors. This includes classifying…

Suppose $R\rightarrow S$ is a faithfully flat ring map. The theory of twisted forms lets one compute, given an $R$-module $M$, how many isomorphism classes of $R$-modules $M^{\prime}$ satisfy $S\otimes_R M\cong S\otimes_R M^{\prime}$. This…

Recent progress in generalised geometry and extended field theories suggests a deep connection between consistent truncations and dualities, which is not immediately obvious. A prime example is generalised Scherk-Schwarz reductions in…

In the BCSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the real Halting Language. This solution to Post's Problem over…

Classical convergence theory of Runge-Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic…

The Ginsburg--Sands theorem from topology states that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on $\omega$: indiscrete, discrete, initial segment, final segment,…

The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…

This work studies the complexity of refuting the existence of a perfect matching in spectral expanders with an odd number of vertices, in the Polynomial Calculus (PC) and Sum of Squares (SoS) proof system. Austrin and Risse [SODA, 2021]…

This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dim_H(S) and constructive packing dimension dim_P(S) is Turing…

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

Ramsey's theorem states that for all finite colorings of an infinite set, there exists an infinite homogeneous subset. What if we seek a homogeneous subset that is also order-equivalent to the original set? Let $S$ be a linearly ordered set…

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…

Even if a ring A is coherent, the polynomial ring A[X] in one variable could fail to be coherent. In this note we show that A[X] is graded coherent with the standard grading deg X=1. More generally, we give a criterion of graded…

A Turing degree is d.c.e. if it contains a set that is the difference of two c.e. sets. A d.c.e. degree $\mathbf{d}$ is isolated by a c.e. degree $\mathbf{a}<\mathbf{d}$ if all c.e. degrees that are below $\mathbf{d}$ are also below…

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

We answer a question posed by Hirschfeldt and Jockusch by showing that whenever $k > \ell$, Ramsey's theorem for singletons and $k$-colorings, $\mathsf{RT}^1_k$, is not strongly computably reducible to the stable Ramsey's theorem for…

We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several questions of Reed and Wood on embedding sparse…