Related papers: A Garside-theoretic approach to the reducibility p…

We show that, up to a natural equivalence relation, the only non-trivial, non-identity holomorphic maps $\mathrm{Conf}_n\mathbb{C}\to\mathrm{Conf}_m\mathbb{C}$ between unordered configuration spaces, where $m\in\{3,4\}$, are the resolving…

A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…

A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…

The Dirichlet Laplacian in a curved three-dimensional tube built along a spatial (bounded or unbounded) curve is investigated in the limit when the uniform cross-section of the tube diminishes. Both deformations due to bending and twisting…

The group described in this paper appeared while studying fundamental groups of complements of branch curves. It turned out that a certain quotient of the braid group acts on those fundamental groups and studying this action is essential…

We prove a semistable reduction theorem for principal bundles on curves in almost arbitrary characteristics. For exceptional groups we need some small explicit restrictions on the characteristic.

We develop a new approach to the linear ordering of the braid group $B\_n$, based on investigating its restriction to the set $\Div(\Delta\_n^d)$ of all divisors of $\Delta\_n^d$ in the monoid $B\_\infty^+$, i.e., to positive $n$-braids…

We generalize the Embedding Theorem of Eisenbud-Harris from classical Brill-Noether theory to the setting of Hurwitz-Brill-Noether theory. More precisely, in classical Brill-Noether theory, the embedding theorem states that a general linear…

Given a projective surface and a generic projection to the plane, the braid monodromy factorization (and thus, the braid monodromy type) of the complement of its branch curve is one of the most important topological invariants, stable on…

Let M be a compact, connected non-orientable surface without boundary and of genus g greater than or equal to 3. We investigate the pure braid groups P_n(M) of M, and in particular the possible splitting of the Fadell-Neuwirth short exact…

We study the M-theory five-brane wrapped around the Seiberg-Witten curves for pure classical and exceptional groups given by an integrable system. Generically, the D4-branes arise as cuts that collapse to points after compactifying the…

An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…

A simple braid is a positive braid that can be drawn so that any two strands cross at most once. We prove that as $n \to \infty$, the proportion of simple braids on $n$ strands that have positive topological entropy tends toward $100\%$.…

We study scale-invariant geometric quantities associated with embedded closed curves in Euclidean three-space, with an emphasis on their behavior under optimization within a fixed knot type. Given a Euclidean-invariant and scale-covariant…

Let $D$ be a strongly connected digraph. An arc set $S$ of $D$ is a \emph{restricted arc-cut} of $D$ if $D-S$ has a non-trivial strong component $D_{1}$ such that $D-V(D_{1})$ contains an arc. The \emph{restricted arc-connectivity}…

We study the branch of semi-stable and unstable solutions (i.e., those whose Morse index is at most one) of the Dirichlet boundary value problem $-\Delta u=\frac{\lambda f(x)}{(1-u)^2}$ on a bounded domain $\Omega \subset \R^N$, which…

Dehn twists around simple closed curves in oriented surfaces satisfy the braid relations. This gives rise to a group theoretic from the braid group to the mapping class group. We prove here that this map is trivial in stable homology with…

We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…

Let f: Y -> CP^2 be a birational morphism of non-singular (rational) surfaces. We give an effective (necessary and sufficient) criterion for algebraicity of the surfaces resulting from contraction of the union of the strict transform of a…

Deep neural networks (DNNs) offer significant flexibility and robust performance. This makes them ideal for building not only system models but also advanced neural network controllers (NNCs). However, their high complexity and…