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

25507499 · Jun 202019922001200920172026
48 results for topological flips

This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the boundary curve. The surfaces we consider topologically fill this boundary curve s…

2014-07-06abs ↗pdf ↗

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds on distance between triangulations that only depend on the topology of the surfac…

2015-09-14abs ↗pdf ↗

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus gg with a single boundary curve and nn marked points on this curve; we consider triangulations up to homeomor…

2015-10-26abs ↗pdf ↗

Double pants decompositions were introduced in our paper "Double pants decompositions of 2-surfaces" (Mosc. Math. J. 11 (2011), no. 2, 231-258, arXiv:1005.0073), together with a flip-twist groupoid acting on these decompositions. It was shown that flip-twist groupoid acts transitively on a certain topological class of …

2015-09-27abs ↗pdf ↗

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometr…

2016-02-15abs ↗pdf ↗

Constructs combinatorial 2D topological field theories from cyclic A-infinity algebras.

problem Developing a combinatorial framework for 2D topological field theories.
method Using triangulations and polygonal decompositions, constructing cochains on a CW complex.
result Existence of combinatorial 2D topological field theories based on cyclic A-infinity algebras.

Study flip graphs for surfaces of infinite type, finding uncountably many connected components.

problem Understanding relationships between triangulations of infinite type surfaces via flips.
method Associate triangulations to flip graphs and study sequences of simultaneous flips.
result Flip graphs for infinite type surfaces have uncountably many connected components.

A double pants decomposition of a 2-dimensional surface is a collection of two pants decomposition of this surface introduced in arXiv:1005.0073v2. There are two natural operations acting on double pants decompositions: flips and handle twists. It is shown in arXiv:1005.0073v2 that the groupoid generated by flips and h…

2010-08-22abs ↗pdf ↗

We study various analogues of theorems from PL topology for cubical complexes. In particular, we characterize when two PL homeomorphic cubulations are equivalent by Pachner moves by showing the question to be equivalent to the existence of cobordisms between generic immersions of hypersurfaces. This solves a question a…

2020-01-04abs ↗pdf ↗

Study of flip graphs and their automorphism groups for infinite-type surfaces.

problem Understanding automorphism groups of flip graphs for infinite-type surfaces.
method Examined the relationship between mapping class groups and flip graphs for infinite-type surfaces.
result Extended mapping class groups are isomorphic to proper subgroups of automorphism groups of flip graphs.

Study shows flipping a small subset of labels can severely damage machine learning models.

problem Adversarial attacks on distributed machine learning models.
method Formalized label flipping attacks, proposed a greedy algorithm, demonstrated with logistic regression models.
result A budget of only 0.1% of labels at each training step can reduce model accuracy by 6%, and some models can perform worse than random guessing when up to 25% of labels are flipped.

The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichmüller space and is quasi-isometric to the underlying mapping class group. We study this space…

2014-11-16abs ↗pdf ↗

Neural networks have been criticized for their lack of easy interpretation, which undermines confidence in their use for important applications. Here, we introduce a novel technique, interpreting a trained neural network by investigating its flip points. A flip point is any point that lies on the boundary between two o…

2019-03-21abs ↗pdf ↗

Efficiently poisons offline RLHF models by flipping preference labels.

problem Vulnerability of offline RLHF models to preference label flipping attacks.
method Developed two attack methods: BAL-A and BMP-A, solving a structured binary sparse approximation problem.
result Demonstrated that flipping one preference label induces a parameter-independent shift in the DPO gradient, enabling structured binary sparse approximation.

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

problem Understanding the relationship between flip distance and polyhedron triangulation numbers.
method Provided examples to demonstrate the difference between flip distance and polyhedron triangulation numbers.
result Ratio of flip distance to polyhedron triangulation numbers can be arbitrarily close to 3/2.

We study the formation of finite time singularities of the Kahler-Ricci flow in relation to high codimensional birational surgery in algebraic geometry. We show that the Kahler-Ricci flow on an n-dimensionl Kahler manifold contracts a complex submanifold Pm\mathbb{P}^m with normal bundle $\oplus_{j=1}^{n-m}\mathcal{O}_…

2013-04-09abs ↗pdf ↗

We prove that every injective simplicial map F(S)F(S)\mathcal{F}(S) \to \mathcal{F}(S') between flip graphs is induced by a subsurface inclusion SSS\to S', except in finitely many cases. This extends a result of Korkmaz--Papadopoulos which asserts that every automorphism of the flip graph of a surface without boundary is ind…

2014-09-24abs ↗pdf ↗

We introduce a notion of cross-flips: local moves that transform a balanced (i.e., properly (d+1)(d+1)-colored) triangulation of a combinatorial dd-manifold into another balanced triangulation. These moves form a natural analog of bistellar flips (also known as Pachner moves). Specifically, we establish the following the…

2015-12-14abs ↗pdf ↗

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge f…

2019-12-10abs ↗pdf ↗

In order to model volatile real-world network behavior, we analyze phase-flipping dynamical scale-free network in which nodes and links fail and recover. We investigate how stochasticity in a parameter governing the recovery process affects phase-flipping dynamics, and find the probability that no more than q% of nodes…

2014-01-29abs ↗pdf ↗

Let ΣΣ be a compact surface. We prove that the set of surface cubications modulo flips, up to isotopy, is in one-to-one correspondence with Z/2ZH1(Σ,Z/2Z)\Z/2\Z\oplus H_1(Σ,\Z/2\Z).

2005-01-31abs ↗pdf ↗

Study finds flipped classrooms improve student self-concept, enjoyment, but not exam scores.

problem Evaluating the impact of flipped classrooms on higher education outcomes.
method Double/debiased machine learning (DML) approach to analyze student data.
result No significant positive effects on exam scores, passing rates, or knowledge retention.

Study quasisymmetric maps on hyperbolic plane boundaries.

problem Identify quasisymmetric maps corresponding to specific lambda lengths and flip distances.
method Analyze maps on Farey triangulation, relate to shearing coordinates and flip distance.
result Identify quasisymmetric maps corresponding to pinched lambda lengths and flip distances.

Unimodal sequences of moves connect 3-manifold triangulations.

problem Understanding the structure of sequences of bistellar flips.
method Examined unimodal sequences of moves that increase and decrease triangulation size.
result Proved that any two one-vertex triangulations are connected by a unimodal sequence of moves.

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and topology. We show a number of rigidity results, namely showing that, under certa…

2019-02-28abs ↗pdf ↗

The paper bounds distances and transformations between pants decompositions and triangulations on surfaces.

problem Finding bounds on distances and transformations between pants decompositions and triangulations.
method Using pre-triangulations, train tracks, and Agol-Hass-Thurston algorithm.
result Upper bounds on distances and transformations between pants decompositions and triangulations.

Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable subsurfaces of S.

2015-11-16abs ↗pdf ↗

Deep Partition Aggregation defends against poisoning attacks with provable certificates.

problem Adversarial poisoning attacks corrupt classifier test-time behavior.
method Deep Partition Aggregation (DPA) is an ensemble method using hash partitions and base models trained on these partitions.
result DPA can certify >= 50% of test images against over 500 poison image insertions on MNIST, and nine insertions on CIFAR-10.

A branched affine structure on a compact topological surface with marked points is a complex affine structure outside the marked points. We give a proof of an unpublished foundational theorem of Veech, stating that any branched affine surface can be decomposed into affine triangles and some annulus-shaped cylinders. Th…

2019-11-30abs ↗pdf ↗

Many machine learning systems rely on data collected in the wild from untrusted sources, exposing the learning algorithms to data poisoning. Attackers can inject malicious data in the training dataset to subvert the learning process, compromising the performance of the algorithm producing errors in a targeted or an ind…

2018-03-02abs ↗pdf ↗

The study examines flip-graphs of non-orientable surfaces and their diameters.

problem Understanding the structure and diameter of flip-graphs of non-orientable surfaces.
method Constructing triangulations of non-orientable surfaces, quotienting by homeomorphisms, and analyzing the resulting flip-graphs.
result Bounds on the diameter of flip-graphs of non-orientable surfaces, with specific growth rates for Möbius strips.

We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by b-flips (i.e. branched diagonal exchanges) and isotopy keeping V point-wise fixed. …

2019-03-29abs ↗pdf ↗

We introduce a representation theory for risk operations on locally compact groups in a partition of unity on a topological manifold for Markowitz-Tversky-Kahneman (MTK) reference points. We identify (1) risk torsion induced by the flip rate for risk averse and risk seeking behaviour, and (2) a structure constant or co…

2012-06-12abs ↗pdf ↗