English
Related papers

Related papers: Minimal braid representatives of quasipositive lin…

200 papers

Let A be a basic connected finite dimensional algebra over an algebraically closed field. Assuming that A is quasitilted, we prove that A is simply connected if and only if its first Hochschild cohomology group HH^1(A) vanishes. This…

Representation Theory · Mathematics 2007-05-23 Patrick Le Meur

A spectral minimal partition of a manifold is its decomposition into disjoint open sets that minimizes a spectral energy functional. It is known that bipartite spectral minimal partitions coincide with nodal partitions of Courant-sharp…

Analysis of PDEs · Mathematics 2024-06-07 Gregory Berkolaiko , Yaiza Canzani , Graham Cox , Jeremy L. Marzuola

We study one-sided substitution subshifts, and how they can be represented using Bratteli-Vershik systems. In particular we focus on minimal recognizable substitutions such that the generated one-sided substitution subshift contains only…

Dynamical Systems · Mathematics 2010-12-15 Reem Yassawi

We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…

Geometric Topology · Mathematics 2024-08-21 Yangxiao Luo , Shunyu Wan

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Rings and Algebras · Mathematics 2026-04-07 Krzysztof Krupiński , Simon Machado

Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances…

Optimization and Control · Mathematics 2012-12-03 Julie Delon , Julien Salomon , Andrei Sobolevski

We lay the foundations for the study of relatively quasiconvex subgroups of relatively hyperbolic groups. These foundations require that we first work out a coherent theory of countable relatively hyperbolic groups (not necessarily finitely…

Group Theory · Mathematics 2016-01-20 G. Christopher Hruska

We show that quasi-isometries of (well-behaved) hierarchically hyperbolic groups descend to quasi-isometries of their maximal hyperbolic space. This has two applications, one relating to quasi-isometry invariance of acylindrical…

Group Theory · Mathematics 2025-01-08 Antoine Goldsborough , Mark Hagen , Harry Petyt , Jacob Russell , Alessandro Sisto

Every simple Hermitian Lie group has a unique family of spherical representations induced from a maximal parabolic subgroup whose unipotent radical is a Heisenberg group. For most Hermitian groups, this family contains a complementary…

Representation Theory · Mathematics 2023-04-13 Jan Frahm , Clemens Weiske , Genkai Zhang

Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…

Physics and Society · Physics 2019-11-27 Gorka Zamora-López , Romain Brasselet

Characterizations of "almost associative" binary operations generating a minimal clone are given for two interpretations of the term "almost associative". One of them uses the associative spectrum, the other one uses the index of…

Rings and Algebras · Mathematics 2011-02-11 Tamás Waldhauser

We construct orbifolds with quasitoric boundary and show that they have stable almost complex structure. We show that a quasitoric orbifold is complex cobordant to finite disjoint copies of complex orbifold projective spaces. Finally some…

Algebraic Topology · Mathematics 2016-02-01 Soumen Sarkar

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

Group Theory · Mathematics 2019-06-12 Benjamin Blanchette , Christian Choffrut , Christophe Reutenauer

A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…

Geometric Topology · Mathematics 2017-12-18 Adam M. Lowrance , Dean Spyropoulos

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

Combinatorics · Mathematics 2024-02-23 Marco Aldi

We present new techniques to show hyperbolicity of links based on geometric/combinatorial topology. Our techniques are applicable to links that have at least one unknotted component. In particular, they are applicable to Brunnian links. We…

Geometric Topology · Mathematics 2025-08-19 Sheng Bai

We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…

Geometric Topology · Mathematics 2022-09-22 Hans U. Boden , Homayun Karimi

We give a complete classification of homomorphisms from the commutator subgroup of the braid group on $n$ strands to the braid group on $n$ strands when $n$ is at least 7. In particular, we show that each nontrivial homomorphism extends to…

Geometric Topology · Mathematics 2022-03-14 Kevin Kordek , Dan Margalit

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

Information Theory · Computer Science 2019-03-27 Martino Borello , Cem Güneri , Elif Saçıkara , Patrick Solé

Let $G=(V,E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $\lambda(G)$, is the cardinality of a minimum edge-cut of $G$. We call $G$ maximally edge-connected if $\lambda(G)=\delta(G)$, and $G$…

Combinatorics · Mathematics 2016-11-15 Yingzhi Tian , Jixiang Meng , Xing Chen