English
Related papers

Related papers: Sard's conjecture for degenerate Engel

200 papers

We use Janson's dependency criterion to prove that the distribution of $d$-descents of permutations of length $n$ converge to a normal distribution as $n$ goes to infinity. We show that this remains true even if $d$ is allowed to grow with…

Combinatorics · Mathematics 2007-09-28 Miklos Bona

We prove an $L^2$ theorem on generically surjective morphism of holomorphic vector bundles via a degeneration argument, generalizing the author's previous work on the $L^2$ division theorem of Skoda. The proof is based on Berndtsson's…

Complex Variables · Mathematics 2025-03-04 Roberto Albesiano

Let D be a dendrite and f:D-> D a continuous map. Denote by E(D) and B(D) the sets of endpoints and branch points of D respectively. We show that if E(D) is countable (resp. B(D) is discrete) then f is pointwise-recurrent if and only if f…

Dynamical Systems · Mathematics 2011-08-16 Issam Naghmouchi

Let $X$ be a smooth dendroid in the plane $\mathbb R^2$. We show that each endpoint of $X$ is arcwise accessible from $\mathbb R^2\setminus X$, and that the space of endpoints $E(X)$ has the property of a circle. In the event that $E(X)$ is…

General Topology · Mathematics 2024-08-27 David S. Lipham

We show that for any closed nonpositively curved Riemannian 4-manifold $M$ with vanishing Euler characteristic, the Ricci curvature must degenerate somewhere. Moreover, for each point $p\in M$, either the Ricci tensor degenerates or else…

Differential Geometry · Mathematics 2023-09-28 Chris Connell , Yuping Ruan , Shi Wang

It is proved that for every $d\ge 2$ such that $d-1$ divides $q-1$, where $q$ is a power of 2, there exists a Denniston maximal arc $A$ of degree $d$ in $\PG(2,q)$, being invariant under a cyclic linear group that fixes one point of $A$ and…

Combinatorics · Mathematics 2017-12-04 Stefaan De Winter , Cunsheng Ding , Vladimir D. Tonchev

The theory of $D$-norms is an offspring of multivariate extreme value theory. We present recent results on $D$-norms, which are completely determined by a certain random vector called generator. In the first part it is shown that the space…

Statistics Theory · Mathematics 2014-09-04 Stefan Aulbach , Michael Falk , Maximilian Zott

While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…

General Mathematics · Mathematics 2014-11-12 O. Veko , E. Ovsiyuk , A. Oana , M. Neagu , V. Balan , V. Red'kov

We describe applications of Koszul cohomology to the Brill-Noether theory of rank 2 vector bundles. Among other things, we show that in every genus g>10, there exist curves invalidating Mercat's Conjecture for rank 2 bundles. On the other…

Algebraic Geometry · Mathematics 2011-09-13 Gavril Farkas , Angela Ortega

In this note we study the distribution of real inflection points among the ovals of a real non-singular hyperbolic curve of even degree. Using Hilbert's method we show that for any integers $d$ and $r$ such that $4\leq r \leq 2d^2-2d$,…

Algebraic Geometry · Mathematics 2014-05-14 Aubin Arroyo , Erwan Brugallé , Lucia López de Medrano

As shown by Ashtekar in the mid 80's, general relativity can be extended to incorporate degenerate metrics. This extension is not unique, however, as one can change the form of the hamiltonian constraints and obtain an {\it alternative}…

General Relativity and Quantum Cosmology · Physics 2009-10-22 Joseph D. Romano

The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…

Combinatorics · Mathematics 2022-11-01 Hua Wang , Andrew Zhang

In this paper, we study quasi post-critically finite degenerations for rational maps. We construct limits for such degenerations as geometrically finite rational maps on a finite tree of Riemann spheres. We prove the boundedness for such…

Dynamical Systems · Mathematics 2021-12-16 Yusheng Luo

A conjecture of Erd\H{o}s from 1967 asserts that any graph on $n$ vertices which does not contain a fixed $r$-degenerate bipartite graph $F$ has at most $Cn^{2-1/r}$ edges, where $C$ is a constant depending only on $F$. We show that this…

Combinatorics · Mathematics 2019-04-16 Andrzej Grzesik , Oliver Janzer , Zoltán Lóránt Nagy

We prove a Skoda-type division theorem via a degeneration argument. The proof is inspired by B. Berndtsson and L. Lempert's approach to the $L^2$ extension theorem and is based on positivity of direct image bundles. The same tools are then…

Complex Variables · Mathematics 2024-02-01 Roberto Albesiano

We study the local differential geometry of varieties $X^n\subset \Bbb C\Bbb P^{n+a}$ with degenerate secant and tangential varieties. We show that the second fundamental form of a smooth variety with degenerate tangential variety is…

alg-geom · Mathematics 2008-02-03 J. M. Landsberg

Let $X$ be a submanifold of dimension $d\geq 2$ of the complex projective space $\mathbb P^n$. We prove results of the following type. i) If $X$ is irregular and $n=2d$ then the normal bundle $N_{X|\mathbb P^n}$ is indecomposable. ii) If…

Algebraic Geometry · Mathematics 2007-05-23 Lucian Badescu

Gallai's path decomposition conjecture states that if $G$ is a connected graph on $n$ vertices, then the edges of $G$ can be decomposed into at most $\lceil \frac{n }{2} \rceil$ paths. A graph is said to be an odd semi-clique if it can be…

Combinatorics · Mathematics 2024-02-14 Nevil Anto , Manu Basavaraju

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

Probability · Mathematics 2015-05-27 Laszlo Erdos , Antti Knowles , Horng-Tzer Yau , Jun Yin

We show that for each \ell\geq 4 every sufficiently large oriented graph G with \delta^+(G), \delta^-(G) \geq \lfloor |G|/3 \rfloor +1 contains an \ell-cycle. This is best possible for all those \ell\geq 4 which are not divisible by 3.…

Combinatorics · Mathematics 2009-08-13 Luke Kelly , Daniela Kühn , Deryk Osthus