Related papers: Sard's conjecture for degenerate Engel

We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire,…

Let $X$ be the product of two projective spaces and consider the general CICY threefold $Y$ in $X$ with configuration matrix $A$. We prove the finiteness part of the analogue of the Clemens' conjecture for such a CICY in low bidegrees. More…

We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…

let f be an endomorphism of a complex projective space, of degree bigger than one. Let us call an algebraic subset exceptional for f, if its inverse image is set-theoretically equal to itself. J.-Y. Briend, S. Cantat and M. Shishikura…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

We prove that the degenerate part of the distributive homology of a multispindle is determined by the normalized homology. In particular, when the multispindle is a quandle $Q$, the degenerate homology of $Q$ is completely determined by the…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…

A real 2-elementary K3 surfaces of type ((3,1,1),- id) yields a real anti-bicanonical curve s \cup A^\prime_1 (disjoint union) on the 4-th real Hirzebruch surface F_4 where s is the exceptional section of F_4 and the real curve A^\prime_1…

Given a digraph $D=(V,A)$ on $n$ vertices and a vertex $v\in V$, the cycle-degree of $v$ is the minimum size of a set $S \subseteq V(D) \setminus \{v\}$ intersecting every directed cycle of $D$ containing $v$. From this definition of…

We investigate the regularising properties of singular kernels at the level of germs, i.e. families of distributions indexed by points in $\mathbb{R}^d$. First we construct a suitable integration map which acts on general coherent germs.…

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

We consider a family of variational problems on a Hilbert manifold parameterized by an open subset of a Banach manifold, and we discuss the genericity of the nondegeneracy condition for the critical points. Based on an idea of B. White, we…

Let $G$ be an undirected simple connected graph. We say a vertex $u$ is eccentric to a vertex $v$ in $G$ if $d(u,v)=\max\{d(v,w): w\in V(G)\}$. The eccentric graph, $E(G)$ of $G$ is a graph defined on the same vertex set as of $G$ and two…

Let $K$ be a complete graph of order $n$. For $d\in (0,1)$, let $c$ be a $\pm 1$-edge labeling of $K$ such that there are $d{n\choose 2}$ edges with label $+1$, and let $G$ be a spanning subgraph of $K$ of maximum degree at most $\Delta$.…

One deals with degenerations by coordinate sections of the square generic Hankel matrix over a field $k$ of characteristic zero, along with its main related structures, such as the determinant of the matrix, the ideal generated by its…

A network $N$ on a finite set $X$, $|X|\geq 2$, is a connected directed acyclic graph with leaf set $X$ in which every root in $N$ has outdegree at least 2 and no vertex in $N$ has indegree and outdegree equal to 1; $N$ is arboreal if the…

We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the…