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

It was recently determined exactly through how many general points a nondegenerate curve with nonspecial hyperplane section can pass. This gives rise to a method of constructing reducible curves $C_1 \cup_\Gamma C_2 \to \mathbb{P}^r$ with…

In this paper, we study maps from reducible curves $f : C \cup_\Gamma D \to \mathbb{P}^r$. We restrict our attention to two cases: first, when $f|_D$ factors through a hyperplane $H$ and $f|_C$ is transverse to $H$; and second, when $r =…

We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…

We develop a probabilistic method for assessing the tail behavior and geometric stability of one-dimensional n i.i.d. samples by tracking how their span contracts when the most extreme points are trimmed. Central to our approach is the…

In this paper we study the arithmetic and invariant theory of genus one normal curves embedded in $\mathbb{P}^{n-1}$. We generalize the notion of genus one model of degree $n$, introduced by Cremona, Fisher and Stoll for $n \leq 5$, to…

We classify six-dimensional F-theory compactifications in terms of simple features of the divisor structure of the base surface of the elliptic fibration. This structure controls the minimal spectrum of the theory. We determine all…

In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…

We use Drinfeld's relative compactifications and the Tannakian viewpoint on principal bundles to construct the Harder-Narasimhan stratification of the moduli stack Bun_G of G-bundles on an algebraic curve in arbitrary characteristic,…

An identifying code is a subset of vertices of a graph such that each vertex is uniquely determined by its neighbourhood within the identifying code. If $\M(G)$ denotes the minimum size of an identifying code of a graph $G$, it was…

We propose a bottom-up approach to the building of particle physics models from string theory. Our building blocks are Type II D-branes which we combine appropriately to reproduce desirable features of a particle theory model: 1) Chirality…

Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…

McCuaig (2001, Brace Generation, J. Graph Theory 38: 124-169) proved a generation theorem for braces, and used it as the principal induction tool to obtain a structural characterization of Pfaffian braces (2004, P{\'o}lya's Permanent…

A graph $G$ is said to be $d$-distinguishable if there is a vertex coloring of $G$ with a set of $d$ colors which breaks all of the automorphisms of $G$ but the identity. We call the minimum $d$ for which a graph $G$ is $d$-distinguishiable…

We introduce three new cut tree structures of graphs $G$ in which the vertex set of the tree is a partition of $V(G)$ and contractions of tree vertices satisfy sparsification requirements that preserve various types of cuts. Recently,…

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The…

Recently, there have been several progresses for the conjugacy search problem (CSP) in Garside groups, especially in braid groups. All known algorithms for solving this problem use a sort of exhaustive search in a particular finite set such…

We show that branched coverings of surfaces of large enough genus arise as characteristic maps of braided surfaces that is, lift to embeddings in the product of the surface with $\mathbb R^2$. This result is nontrivial already for…

Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. We consider the (small)…

We show that the group cohomology of the diffeomorphisms of the disk with $n$ punctures has the cohomology of the braid group of $n$ strands as the summand. As an application of this method, we also prove that there is no cohomological…

We revisit classical connectivity problems in the CONGEST model of distributed computing. By using techniques from fault tolerant network design, we show improved constructions, some of which are even "local" (i.e., with $\widetilde{O}(1)$…