Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

90181271361 · Jun 202019922001200920172026
48 results for reducible elements

New findings on generating mapping class groups using pseudo-Anosov elements.

problem Generating mapping class groups using specific types of elements.
method Proving the generation of mapping class groups by pseudo-Anosov elements and conjugate reducible but not periodic elements.
result The mapping class group can be generated by two conjugate pseudo-Anosov elements with arbitrarily large dilatations for surfaces of genus greater than or equal to nine.

Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in Gamma which are multi-twists. As a consequence we are able to list all the lanter…

2002-06-12abs ↗pdf ↗

Let DnD_n denote the nn-punctured disk in the complex plane, where the punctures are on the real axis. An nn-braid αα is said to be \emph{reducible} if there exists an essential curve system $\C$ in DnD_n, called a \emph{reduction system} of αα, such that $α*\C=\C$ where $α*\C$ denotes the action of the braid αα o…

2005-06-10abs ↗pdf ↗

The paper proves conditions for the isomorphism between standard and dual Artin groups.

problem Conditions for the isomorphism between standard and dual Artin groups.
method Analyzes Coxeter systems and their actions on reduced words to prove isomorphisms.
result Proves conditions for the isomorphism between standard and dual Artin groups.

Handlebody groups reduced to 3 or 4 generators for g ≥ 5 and 3 or 4 for g ≥ 3.

problem Finding minimal generating sets for handlebody groups.
method Using relations in Wajnryb's presentation to reduce the number of generators.
result Handlebody groups M(Vg)\mathcal{M}(V_g) are generated by 3 or 4 elements for g5g \geq 5 and 3 or 4 for g3g \geq 3.

The paper improves convergence rates of curvature approximations using Regge elements.

problem Improving convergence rates of curvature approximations using Regge elements.
method Investigates the interplay between polynomial degree of curvature lifting and metric tensor degree in Regge finite element space.
result Higher convergence rates are achieved by reducing the polynomial degree of curvature lifting and using linear Regge elements.

For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to supersolvable hyperplane arrangements.

2009-06-25abs ↗pdf ↗

This paper studies parabolic quasi-Coxeter elements in complex reflection groups and their combinatorial properties.

problem Characterizing and studying parabolic quasi-Coxeter elements in complex reflection groups.
method Defining and characterizing parabolic quasi-Coxeter elements, studying collections of reduced reflection factorizations and relative generating sets.
result Computing cardinalities of collections of reduced reflection factorizations and relative generating sets for large families of parabolic quasi-Coxeter elements.

The well-known Gumbel-Max Trick for sampling elements from a categorical distribution (or more generally a nonnegative vector) and its variants have been widely used in areas such as machine learning and information retrieval. To sample a random element ii (or a Gumbel-Max variable ii) in proportion to its positive w…

2020-02-02abs ↗pdf ↗

We enhance the biquandle counting invariant using elements of truncated biquandle-labeled Polyak algebras. These finite type enhancements reduce to the finite type enhancements defined by Goussarov, Polyak and Viro for the trivial biquandle of one element and determine (but are not determined by) the biquandle counting…

2015-06-02abs ↗pdf ↗

Let (V,W;F)(\mathcal{V},\mathcal{W};F) be a weakly reducible, unstabilized, Heegaard splitting of genus at least three in an orientable, irreducible 33-manifold MM. Then Mod(M,F)Mod(M,F) naturally acts on the disk complex D(F)\mathcal{D}(F) as a group action. In this article, we prove if FF is topologically minimal and its topol…

2015-01-20abs ↗pdf ↗

An element in Artin's braid group BnB_n is called periodic if it has a power which lies in the center of BnB_n. The conjugacy problem for periodic braids can be reduced to the following: given a divisor 1d<n11\le d<n-1 of n1n-1 and an element αα in the super summit set of εdε^d, find γBnγ\in B_n such that γ1αγ=εdγ^{-1}αγ=ε^d, …

2016-08-21abs ↗pdf ↗

The paper explores geometric finiteness in mapping class groups and constructs new examples of these subgroups.

problem Understanding geometric finiteness in mapping class groups and constructing new examples.
method Examined several constructions of subgroups and determined conditions for geometric finiteness.
result Provides new examples of parabolically geometrically finite and reducibly geometrically finite subgroups.

We construct a braid conjugacy class invariant κκ by refining Plamenevskaya's transverse element ψψ in Khovanov homology via the annular grading. While κκ is not an invariant of transverse links, it distinguishes some braids whose closures share the same classical invariants but are not transversely isotopic. Using …

2015-07-22abs ↗pdf ↗

In this article we present a finite generating set G2G_2 of H2\mathcal{H}_2, the genus-2 Goeritz group of S3S^3, in terms of Dehn twists about certain simple closed curves on the standard Heegaard surface. We present an algorithm that describes an element ψH2ψ\in\mathcal{H}_2 as a word in the alphabet of G2G_2 in a cert…

2019-12-18abs ↗pdf ↗

The multimodal web elements such as text and images are associated with inherent memory costs to store and transfer over the Internet. With the limited network connectivity in developing countries, webpage rendering gets delayed in the presence of high-memory demanding elements such as images (relative to text). To ove…

2017-11-06abs ↗pdf ↗

The hyperelliptic Torelli group is the subgroup of the mapping class group consisting of elements that act trivially on the homology of the surface and that also commute with some fixed hyperelliptic involution. We prove a Birman exact sequence for hyperelliptic Torelli groups, and we show that this sequence splits. As…

2011-10-06abs ↗pdf ↗

We classify groups generated by powers of 2 Dehn twists which are 1) free or 2) have no ``unexpected'' reducible elements. We give some sufficient conditions in the case of groups generated by powers of more than two twists.

1998-09-28abs ↗pdf ↗

Paper introduces REED for noncoherent OTA-FL, reducing latency without phase alignment.

problem Noncoherent OTA-FL requires signed model updates without phase alignment.
method Introduces REED for continuous signed aggregation using resource-element energy difference.
result Exact variance laws for REED and chip-diverse extension in Rayleigh fading.

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy class which we call the stabilized set of sliding circuits, and if it …

2010-08-02abs ↗pdf ↗

Extends geometric decompositions to arbitrary meshes and forms.

problem Constructing local bases for finite element spaces on arbitrary meshes.
method Generalizes extension operators to arbitrary meshes and forms, showing they yield geometric decompositions.
result Extension operators yield geometric decompositions for arbitrary meshes and forms.

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in the corresponding group if and only if they can be carried to the same tame word b…

2011-03-03abs ↗pdf ↗

It is shown that if one uses the notion of infinity nilpotent elements due to Moerdijk and Reyes, instead of the usual definition of nilpotents to define reduced CC^\infty-schemes, the resulting de Rham spaces are given as quotients by actions of germs of diagonals, instead of the formal neighbourhoods of the diagonal…

2017-01-23abs ↗pdf ↗

We define the reduced Khovanov homology of an open book (S,h), and we identify a distinguished "contact element" in this group which may be used to establish the tightness or non-fillability of contact structures compatible with (S,h). Our construction generalizes the relationship between the reduced Khovanov homology …

2008-08-18abs ↗pdf ↗

We impose constraints on the odd coordinates of super Teichmüller space in the uniformization picture for the monodromies around Ramond punctures, thus reducing the overall odd dimension to be compatible with that of the moduli spaces of super Riemann surfaces. Namely, the monodromy of a puncture must be a true parabol…

2017-09-19abs ↗pdf ↗

Tensorized Rademacher projections outperform Gaussian projections in reducing tensor dimensions.

problem Reducing the dimension of high-dimensional tensors for machine learning.
method Tensorized Rademacher random projections using Tensor Train decomposition.
result Tensorized Rademacher projections can replace Gaussian projections in tensor compression.

We study the structure of the stable coefficients of the Jones polynomial of an alternating link. We start by identifying the first four stable coefficients with polynomial invariants of a (reduced) Tait graph of the link projection. This leads us to introduce a free polynomial algebra of invariants of graphs whose ele…

2013-09-23abs ↗pdf ↗

Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special cases, including W word hyperbolic, and X with isolated flats. We establish tha…

2013-01-05abs ↗pdf ↗

Decomposes elements in multiplicative multivectors and relates to Lie algebroid cohomology.

problem Understanding the structure of multiplicative multivectors on Lie groupoids.
method Proves canonical decomposition formula and establishes relations between quotient spaces.
result Canonical decomposition formula and key relation between reduced spaces.

Suppose, we are given a set of nn elements to be clustered into kk (unknown) clusters, and an oracle/expert labeler that can interactively answer pair-wise queries of the form, "do two elements uu and vv belong to the same cluster?". The goal is to recover the optimum clustering by asking the minimum number of quer…

2017-06-23abs ↗pdf ↗

Confirming the Powell Conjecture for genus-3 Heegaard splittings of the 3-sphere.

problem Proving the finitely generated nature of the Goeritz group for genus-3 Heegaard splittings of the 3-sphere.
method Establishing the connectivity of reducing sphere complexes for the genus-3 case.
result Confirmation of the Powell Conjecture for genus-3 Heegaard splittings of the 3-sphere.

A group of matrices GG with entries in a number field KK is defined to be numerical if GG has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of GL(n,K)GL(n,C)GL(n,K)\subset GL(n,\mathbb{C}) is numerical if and only if the traces of its e…

2019-11-26abs ↗pdf ↗

We obtain sharp estimates on the growth rate of stable commutator length on random (geodesic) words, and on random walks, in hyperbolic groups and groups acting nondegenerately on hyperbolic spaces. In either case, we show that with high probability stable commutator length of an element of length nn is of order $n/\l…

2010-08-29abs ↗pdf ↗

We study very small trees from the point of view of reducing systems of free factors, which are analogues of reducing systems of curves for a surface lamination; a non-trivial, proper free factor $F \leq \FN$ reduces TT if and only if FF acts on some subtree of TT with dense orbits. We characterize those trees, call…

2012-11-14abs ↗pdf ↗