Related papers: Desingularization Explains Order-Degree Curves for…

We consider a regularization concept for the solution of ill--posed operator equations, where the operator is composed of a continuous and a discontinuous operator. A particular application is level set regularization, where we develop a…

Let $T$ be a tree with $t$ edges. We show that the number of isomorphic (labeled) copies of $T$ in a graph $G = (V,E)$ of minimum degree at least $t$ is at least \[2|E| \prod_{v \in V} (d(v) - t + 1)^{\frac{(t-1)d(v)}{2|E|}}.\]…

This paper proposes a simple but effective graph-based agglomerative algorithm, for clustering high-dimensional data. We explore the different roles of two fundamental concepts in graph theory, indegree and outdegree, in the context of…

In this paper we propose the concept of formal desingularizations as a substitute for the resolution of algebraic varieties. Though a usual resolution of algebraic varieties provides more information on the structure of singularities there…

We investigate the relation between degree sequences of trees and the majorization order using the Muirhead theorem. In this way, we prove a theorem that provides a necessary and sufficient condition for delta sequences of trees to be…

A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…

A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian…

The task to construct parametrices of elliptic differential operators on a manifold with edges requires a calculus of operators with a two-component principal symbolic hierarchy, consisting of (edge-degenerate) interior and…

Suppose we are given a pair of points $s, t$ and a set $S$ of $n$ geometric objects in the plane, called obstacles. We show that in polynomial time one can construct an auxiliary (multi-)graph $G$ with vertex set $S$ and every edge labeled…

In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph $G=(V,E)$, together with two degree constraint functions $d^-,d^+ : V \to \mathbb{N}$. The goal is to orient as many edges as possible, in such a…

Let X be a smooth variety over a number field k embedded as a degree d subvariety of $\mathbb{P}^n$ and suppose that X is a counterexample to the Hasse principle explained by the Brauer-Manin obstruction. We consider the question of whether…

We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…

Given a digraph $D$, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in $D$ an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time…

In the present paper, we aim to introduce the cohomology of $\mathcal{O}$-operators defined on the Hom-Lie conformal algebra concerning the given representation. To obtain the desired results, we describe three different cochain complexes…

We derive a new class of one-loop non-renormalization theorems that strongly constrain the running of higher dimension operators in a general four-dimensional quantum field theory. Our logic follows from unitarity: cuts of one-loop…

The Eulerian transformation is the linear operator on polynomials in one variable with real coefficients which maps the powers of this variable to the corresponding Eulerian polynomials. The derangement transformation is defined similarly.…

An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…

A $\mathfrak{g}$-oper for a simple Lie algebra $\mathfrak{g}$ is a specific type of flat principal bundle on an algebraic curve. When the base field is of prime characteristic $p$, those with vanishing $p$-curvature are called dormant…

The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from…

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…