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

We investigate the spectrum of the Dirichlet Laplacian in a unbounded strip subject to a new deformation of "shearing": the strip is built by translating a segment oriented in a constant direction along an unbounded curve in the plane. We…

Consider genus $g$ curves that admit degree $d$ covers to elliptic curves only branched at one point with a fixed ramification type. The locus of such covers forms a one parameter family $Y$ that naturally maps into the moduli space of…

The deep connections between braids and dynamics by way of the Nielsen-Thurston classification theorem have led to a wide range of practical applications. Braids have been used to detect coherent structures and mixing regions in oceanic…

Our aim is to determine the lower central series (LCS) and derived series (DS) for the braid groups of the sphere and of the finitely-punctured sphere. We show that for all n (resp. all n\geq 5), the LCS (resp. DS) of the n-string braid…

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

We give an algorithm to explicitly determine all elements of the $q$-torsion (for $q$ an odd prime) of the Brauer group of an elliptic curve over any base field of characteristic different from $q$, containing a primitive $q$-th root of…

The Stable Reduction Theorem guarantees that any smooth, projective, geometrically irreducible curve of genus $g \geq 2$ over a discretely valued field admits a unique stable model after a finite field extension. Computing this model is a…

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…

Since its inception, Benders Decomposition (BD) has been successfully applied to a wide range of large-scale mixed-integer (linear) problems. The key element of BD is the derivation of Benders cuts, which are often not unique. In this…

For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…

We study distributed algorithms built around minor-based vertex sparsifiers, and give the first algorithm in the CONGEST model for solving linear systems in graph Laplacian matrices to high accuracy. Our Laplacian solver has a round…

A braided generalization of the concept of Hopf algebra (quantum group) is presented. The generalization overcomes an inherent geometrical inhomogeneity of quantum groups, in the sense of allowing completely pointless objects. All…

The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity…

Graph separation is a central tool in parameterized algorithm design, and important separators are among its most successful ingredients. They yield small, structured families of separators that can be enumerated efficiently, and underlie…

We describe algorithms to efficiently compute minimum $(s,t)$-cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph $G$ with $n$ vertices embedded on an orientable surface of genus $g$,…

A defining feature of topologically ordered states of matter is the existence of locally indistinguishable states on spaces with non-trivial topology. These degenerate states form a representation of the mapping class group (MCG) of the…

We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$…

Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…

We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show that (i) there is a bounded-error randomized algorithm that computes edge connectivity with $O(n)$ cut queries, and (ii) there is a…

We study conchoids to algebraic curve from the perspective of algebraic geometry, analyzing their main algebraic properties. We introduce the formal definition of conchoid of an algebraic curve by means of incidence diagrams. We prove that,…