Related papers: A Garside-theoretic approach to the reducibility p…
We consider parahoric Bruhat-Tits group schemes over a smooth projective curve and torsors under them. If the characteristic of the ground field is either zero or positive but not too small and the generic fiber is absolutely simple and…
Structured sparsity regularization offers a principled way to compact neural networks, but its non-differentiability breaks compatibility with conventional stochastic gradient descent and requires either specialized optimizers or additional…
A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…
Given a graph, the sparsest cut problem asks for a subset of vertices whose edge expansion (the normalized cut given by the subset) is minimized. In this paper, we study a generalization of this problem seeking for $ k $ disjoint subsets of…
An \emph{$\mathbb{R}$-join-type curve} is a curve in $\mathbb{C}^2$ defined by an equation of the form \begin{equation*} a\cdot\prod_{j=1}^\ell (y-\beta_j)^{\nu_j} = b\cdot\prod_{i=1}^m (x-\alpha_i)^{\lambda_i}, \end{equation*} where the…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…
We initiate a general approach to the relative braid group symmetries on (universal) $\imath$quantum groups, arising from quantum symmetric pairs of arbitrary finite types, and their modules. Our approach is built on new intertwining…
In this article I define and study the overconvergent rigid fundamental group of a variety over an equicharacteristic local field. This is a non-abelian $(\varphi,\nabla)$-module over the bounded Robba ring $\mathcal{E}_K^\dagger$, whose…
A non-trivial minimum cut (NMC) sparsifier is a multigraph $\hat{G}$ that preserves all non-trivial minimum cuts of a given undirected graph $G$. We introduce a flexible data structure for fully dynamic graphs that can efficiently provide…
We study ribbons of vanishing Gaussian curvature, i.e., flat ribbons, constructed along a curve in $\mathbb{R}^{3}$. In particular, we first investigate to which extent the ruled structure determines a flat ribbon: in other words, we ask…
The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$, in which two distinct vertices are adjacent if one of them is a power of the other. For an integer $n\geq 2$, let $C_n$ denote the cyclic group…
In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…
We present near-optimal algorithms for detecting small vertex cuts in the CONGEST model of distributed computing. Despite extensive research in this area, our understanding of the vertex connectivity of a graph is still incomplete,…
We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs. The contractions exploit 2-out edge sampling from each vertex rather than the standard uniform edge sampling. We…
Given $\alpha \in (0, \infty)$ and $r \in (0, \infty)$, let ${\cal D}_{r, \alpha}$ be the disc of radius $r$ in the hyperbolic plane having curvature $-\alpha^2$. Consider the Poisson point process having uniform intensity density on ${\cal…
The restricted edge-connectivity of a connected graph $G$, denoted by $\lambda^{\prime}(G)$, if it exists, is the minimum cardinality of a set of edges whose deletion makes $G$ disconnected and each component with at least 2 vertices. It…
It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…
A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…
Network pruning is a commonly used measure to alleviate the storage and computational burden of deep neural networks. However, the fundamental limit of network pruning is still lacking. To close the gap, in this work we'll take a…
Let $G$ be a split reductive group over a field $k$ of arbitrary characteristic, chosen suitably. Let $X\to S$ be a smooth projective morphism of locally noetherian $k$-schemes, with geometrically connected fibers. We show that for each…