中文
相关论文

相关论文: A Garside-theoretic approach to the reducibility p…

200 篇论文

We initiate the study of a class of real plane algebraic curves which we call expressive. These are the curves whose defining polynomial has the smallest number of critical points allowed by the topology of the set of real points of a…

代数几何 · 数学 2023-08-29 Sergey Fomin , Eugenii Shustin

We show that the morphisms from the braid group with n strands in the mapping class group of a surface with a possible non empty boundary, assuming that its genus is smaller or equal to n/2 are either cyclic morphisms (their images are…

群论 · 数学 2011-04-20 Fabrice Castel

This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group G is a finite set…

几何拓扑 · 数学 2007-05-23 Joan S. Birman , Volker Gebhardt , Juan Gonzalez-Meneses

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

几何拓扑 · 数学 2013-09-27 Sandrine Caruso , Bert Wiest

Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…

社会与信息网络 · 计算机科学 2025-12-08 Iiro Kumpulainen , Nikolaj Tatti

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…

几何拓扑 · 数学 2007-05-23 Nuno Franco , Juan Gonzalez-Meneses

We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph $G$ on $n$ vertices, and two positive integers $k$ and $x$, determine whether $G$ has a set of $k$ vertices whose removal leaves $G$ with at…

数据结构与算法 · 计算机科学 2015-06-30 Danny Hermelin , Moshe Kaspi , Christian Komusiewicz , Barak Navon

Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…

群论 · 数学 2007-05-23 Patrick Dehornoy

We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…

群论 · 数学 2024-12-04 Stepan Yu. Orevkov

The cutoff phenomenon was recently shown to systematically follow from non-negative curvature and the product condition, for all Markov diffusions. The proof crucially relied on a classical \emph{chain rule} satisfied by the carr\'e du…

概率论 · 数学 2025-01-23 Francesco Pedrotti , Justin Salez

We present a \emph{deterministic exact algorithm} for the \emph{minimum $k$-cut problem} on simple graphs. Our approach combines the \emph{principal sequence of partitions (PSP)}, derived canonically from ideal loads, with a single level of…

数据结构与算法 · 计算机科学 2025-12-23 Mohit Daga

We consider the problem of finding a minimum cut of a weighted graph presented as a single-pass stream. While graph sparsification in streams has been intensively studied, the specific application of finding minimum cuts in streams is less…

数据结构与算法 · 计算机科学 2024-12-09 Matthew Ding , Alexandro Garces , Jason Li , Honghao Lin , Jelani Nelson , Vihan Shah , David P. Woodruff

The stable reduction theorem says that a family of curves of genus $g\geq 2$ over a punctured curve can be uniquely completed (after possible base change) by inserting certain stable curves at the punctures. We give a new proof of this…

微分几何 · 数学 2020-09-30 Jian Song , Jacob Sturm , Xiaowei Wang

The distortion of a curve is the supremum, taken over distinct pairs of points of the curve, of the ratio of arclength to spatial distance between the points. Gromov asked in 1981 whether a curve in every knot type can be constructed with…

几何拓扑 · 数学 2007-05-23 Chad A. S. Mullikin

We study the minimum number of inflection points among generic immersed closed plane curves with a fixed embedded shadow. The word immersed is essential: a genuinely embedded Jordan curve has inflection minimum zero. For tree-like shadows,…

几何拓扑 · 数学 2026-05-28 Boris Shapiro

We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…

几何拓扑 · 数学 2016-09-07 Roger Fenn , Michael T Greene , Dale Rolfsen , Colin Rourke , Bert Wiest

The space of unordered configurations of distinct points in the plane is aspherical, with Artin's braid group as its fundamental group. Remarkably enough, the space of ordered configurations of distinct points on the real projective line,…

代数拓扑 · 数学 2007-05-23 Jack Morava

The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…

代数几何 · 数学 2013-03-01 Sudarshan Gurjar

Periodic solutions of the planar $N$-body problem determine braids through the trajectory of $N$ bodies. Braid types can be used to classify periodic solutions. According to the Nielsen-Thurston classification of surface automorphisms,…

动力系统 · 数学 2022-04-05 Yuika Kajihara , Eiko Kin , Mitsuru Shibayama

The \emph{graph of irreducible parabolic subgroups} is a combinatorial object associated to an Artin-Tits group $A$ defined so as to coincide with the curve graph of the $(n+1)$-times punctured disk when $A$ is Artin's braid group on…

群论 · 数学 2021-03-24 Matthieu Calvez , Bruno A. Cisneros de la Cruz