Related papers: \texorpdfstring{$D$}{D}-maximal many-one degrees c…

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

We prove that, in a finite group, if every rational irreducible character has odd degree, then all rational elements are 2-elements, as it was originally conjectured by Tiep and Tong-Viet.

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

Let $k$ be a perfect field such that for every $n$ there are only finitely many field extensions, up to isomorphism, of $k$ of degree $n$. If $G$ is a reductive algebraic group defined over $k$, whose characteristic is very good for $G$,…

Over an algebraically closed field we classify all minimal representation-infinite algebras where the lattice of two-sided ideals is not distributive. As a consequence there are only finitely many isomorphism classes of minimal…

It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the…

Let S = k[x_1,...,x_n] be a Z^r-graded ring with deg (x_i) = a_i \in Z^r for each i and suppose that M is a finitely generated Z^r-graded S-module. In this paper we describe how to find finite subsets of Z^r containing the multidegrees of…

We extend to the case of a $d$-dimensional compact connected oriented Riemannian manifold $\mathcal M$ the theorem of A. Bondarenko, D. Radchenko and M. Viazovska on the existence of $L$-designs consisting of $N$ nodes, for any $N\ge…

For an immersed minimal surface in $\mathbb{R}^3$, we show that there exists a lower bound on its Morse index that depends on the genus and number of ends, counting multiplicity. This improves, in several ways, an estimate we previously…

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

In this paper, we study the existence of minimal covers and strong minimal covers in the Weihrauch degrees. We characterize when a problem $f$ is a minimal cover or strong minimal cover of a problem $h$. We show that strong minimal covers…

One of the cornerstones of extremal graph theory is a result of F\"uredi, later reproved and given due prominence by Alon, Krivelevich and Sudakov, saying that if $H$ is a bipartite graph with maximum degree $r$ on one side, then there is a…

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

We present a recursive minimal polynomial theorem for finite sequences over a commutative integral domain $D$. This theorem is relative to any element of $D$. The ingredients are: the arithmetic of Laurent polynomials over $D$, a recursive…

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles \textit{``Strong Reducibilities''} (1981) and \textit{``Reducibilities''} (1999). The problem asks whether every computably…

The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…

In this paper we study topological lower bounds on the number of zeros of closed 1-forms without Morse type assumptions. We prove that one may always find a representing closed 1-form having at most one zero. We introduce and study a…

We generalise Birch's seminal work on forms in many variables to handle a system of forms in which the degrees need not all be the same. This allows us to prove the Hasse principle, weak approximation, and the Manin-Peyre conjecture for a…

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…