中文
相关论文

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

200 篇论文

It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…

代数几何 · 数学 2014-01-08 Sonia Perez-Diaz , Sonia L. Rueda , Juana Sendra , J. Rafael Sendra

This paper presents the reachability analysis of curves in $\mathbb{R}^3$ with a prescribed curvature bound. Based on Pontryagin Maximum Principle, we leverage the existing knowledge on the structure of solutions to minimum-time problems,…

最优化与控制 · 数学 2025-03-27 Juho Bae , Ji Hoon Bai , Byung-Yoon Lee , Jun-Yong Lee , Chang-Hun Lee

The distribution of degree $d$ points on curves is well understood, especially for low degrees. We refine this study to include information on the Galois group in the simplest interesting case: $d = 3$. For curves of genus at least 5, we…

数论 · 数学 2025-10-13 James Rawson

In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are…

代数几何 · 数学 2014-01-22 Sonia L. Rueda , Juana Sendra , J. Rafael Sendra

Consider a simple algebraic group G of adjoint type, and its wonderful compactification X. We show that X admits a unique family of minimal rational curves, and we explicitly describe the subfamily consisting of curves through a general…

代数几何 · 数学 2015-07-14 Michel Brion , Baohua Fu

Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$,…

数据结构与算法 · 计算机科学 2018-02-01 Mattia D'Emidio , Luca Forlizzi , Daniele Frigioni , Stefano Leucci , Guido Proietti

We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…

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

Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line…

计算几何 · 计算机科学 2018-03-23 Konstantin Kobylkin

We consider finite pencils of Jacobi matrices \[ J_n(w)=A+wB, \] where $A$ is diagonal and $B$ is tridiagonal with zero diagonal. The spectral curve is the affine plane curve \[ \chi_n(\lambda,w)=\det(\lambda I+J_n(w))=0 . \] The main…

谱理论 · 数学 2026-05-15 B. Shapiro

We establish sufficient conditions for existence of curves minimizing length as measured with respect to a degenerate metric on the plane while enclosing a specified amount of Euclidean area. Non-existence of minimizers can occur and…

微分几何 · 数学 2016-07-29 Jiri Dadok , Peter Sternberg

The Dirichlet p-Laplacian in tubes of arbitrary cross-section along infinite curves in Euclidean spaces of arbitrary dimension is investigated. First, it is shown that the gap between the lowest point of the generalised spectrum and the…

偏微分方程分析 · 数学 2025-04-16 Laura Baldelli , David Krejcirik

An edge subset \( S \subseteq E(G) \) is called a 3-restricted edge-cut if $G-S$ is disconnected and each component of \( G - S \) contains at least three vertices. The 3-restricted edge-connectivity of a graph \( G \), denoted by \(…

组合数学 · 数学 2026-04-14 Wenxin Wang , Yingzhi Tian , Jing Wang

We consider the set E of curves with positive algebraic curvature, whose extremities and tangents in their extremities are given. For each of the curves of E, we define the minimum of the radius of curvature. There exists a unique curve of…

度量几何 · 数学 2021-12-07 Jérôme Bastien

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

数据结构与算法 · 计算机科学 2015-03-19 Anand Louis , Prasad Raghavendra , Prasad Tetali , Santosh Vempala

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…

群论 · 数学 2010-08-02 D. Garber , S. Kaplan , M. Teicher , B. Tsaban , U. Vishne

A common way of partitioning graphs is through minimum cuts. One drawback of classical minimum cut methods is that they tend to produce small groups, which is why more balanced variants such as normalized and ratio cuts have seen more…

机器学习 · 计算机科学 2024-10-07 Chakib Fettal , Lazhar Labiod , Mohamed Nadif

The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that…

几何拓扑 · 数学 2007-05-23 Frank Connolly , Margaret Doig

We show that, in an Artin-Tits group of spherical type, the intersection of two parabolic subgroups is a parabolic subgroup. Moreover, we show that the set of parabolic subgroups forms a lattice with respect to inclusion. This extends to…

Let $G$ be an edge-weighted directed graph with $n$ vertices embedded on an orientable surface of genus $g$. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest…

数据结构与算法 · 计算机科学 2018-04-04 Jeff Erickson , Kyle Fox , Luvsandondov Lkhamsuren

In this article we study the curvature properties of the order complex of a graded poset under a metric that we call the ``orthoscheme metric''. In addition to other results, we characterize which rank 4 posets have CAT(0) orthoscheme…

群论 · 数学 2014-10-01 Tom Brady , Jon McCammond