This paper classifies semi-equivelar maps on a special surface.
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.
Trend · papers per month
A zigzag in a map (a -cell embedding of a connected graph in a connected closed -dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a common vertex, 2) for any three consecutive edges the first and the third edges are …
This paper classifies semi-equivelar gems on a double torus.
We give uniform, explicit, and simple face-pairing descriptions of all the branched cyclic covers of the 3-sphere, branched over two-bridge knots. Our method is to use the bi-twisted face-pairing constructions of Cannon, Floyd, and Parry; these examples show that the bi-twist construction is often efficient and natural…
We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions. Using these descriptions, we give presentations for their fundamental groups, w…
Classifies semi-equivelar gems on surfaces with Euler characteristic -1.
Geometric limits of cyclic subgroups in specific groups studied.
The article explores symmetric maps on surfaces, focusing on semi-equivelar maps.
The virtually cyclic dimension of Out(F_N) is finite and related properties are established.
In this paper we present the construction of explicit quasi-isomorphisms that compute the cyclic homology and periodic cyclic homology of crossed-product algebras associated with (discrete) group actions. In the first part we deal with algebraic crossed-products associated with group actions on unital algebras over any…
An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence. This paper is an investigation into which sequences, either finite or infinite, a…
Arithmetic study of knots connects homology and SL2 representations.
Characterizes sequences from two-component link diagrams.
The study broadens the concept of cyclic polytopes to Veronese polytopes.
Extends Loday-Quillen-Tsygan theorem to bornological Lie algebra homology.
For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in the faces. Furthermore, this Coxeter group is a lattice inside the isometry group …
We study discrete conjugate nets whose Laplace sequence is of period four. Corresponding points of opposite nets in this cyclic sequence have equal osculating planes in different net directions, that is, they correspond in an asymptotic transformation. We show that this implies that the connecting lines of correspondin…
Recognizing facial expressions from static images or video sequences is a widely studied but still challenging problem. The recent progresses obtained by deep neural architectures, or by ensembles of heterogeneous models, have shown that integrating multiple input representations leads to state-of-the-art results. In p…
This is part 2 of a 3-part article where we provide an -algorithm to produce a surgery presentation of a 3-manifold induced by a gem with a resolution. In this part we produce a sequence of colored simplicial 2-complexes which are inverses and dual to the sequence of gems produced in the first part. The refinem…
In this work we present an adversarial training algorithm that exploits correlations in video to learn --without supervision-- an image generator model with a disentangled latent space. The proposed methodology requires only a few modifications to the standard algorithm of Generative Adversarial Networks (GAN) and invo…
This paper characterizes the equilibrium in a continuous time financial market populated by heterogeneous agents who differ in their rate of relative risk aversion and face convex portfolio constraints. The model is studied in an application to margin constraints and found to match real world observations about financi…
CycleFQI tackles offline reinforcement learning for cyclic MDPs, mitigating state distribution mismatch.
Electroencephalography (EEG) is a method to record the electrical signals in the brain. Recognizing the EEG patterns in the sleeping brain gives insights into the understanding of sleeping disorders. The dataset under consideration contains EEG data points associated with various physiological conditions. This study at…
We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R^n-trees. We first prove that Sela's limit groups do have a free action on an R^n-tree. We then prove that a finitely generated group having a free action on an R^n-tree can be obtained from free abelian groups and surfac…
We prove a Godbillon-Vey index formula for longitudinal Dirac operators on a foliated bundle with boundary; in particular, we define a Godbillon-Vey eta invariant on the boundary-foliation; this is a secondary invariant for longitudinal Dirac operators on type-III foliations. Moreover, employing the Godbillon-Vey index…
Thurston's fibered face theory allows us to partition the set of pseudo-Anosov mapping classes on different compact oriented surfaces into subclasses with related dynamical behavior. This is done via a correspondence between the rational points on fibered faces in the first cohomology of a hyperbolic 3-manifold and the…
Troels Jorgensen conjectured that the algebraic and geometric limits of an algebraically convergent sequence of isomorphic Kleinian groups agree if there are no new parabolics in the algebraic limit. We prove that this conjecture holds in 'most' cases. In particular, we show that it holds when the domain of discontinui…
In this paper, we prove than given two cubic knots , in , they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the Reidemeister moves for classical tame knots. We use the fact that a cubic knot is determined by…
In this article, we construct a genus- or genus- positive allowable Lefschetz fibration on any minimal symplectic filling of the link of non-cyclic quotient surface singularities. As a byproduct, we also show that any minimal symplectic filling of the link of quotient surface singularities can be obtained from a …
We construct a positive allowable Lefschetz fibration over the disk on any minimal weak symplectic filling of the canonical contact structure on a lens space. Using this construction we prove that any minimal symplectic filling of the canonical contact structure on a lens space is obtained by a sequence of rational blo…
Study calculates stable norm of slit tori using Farey sequence.
New triangulations encode flows with vanishing polynomial.
New privacy bounds for DP-SGD's last iterate, even with cyclic sampling.
We propose a method for face de-identification that enables fully automatic video modification at high frame rates. The goal is to maximally decorrelate the identity, while having the perception (pose, illumination and expression) fixed. We achieve this by a novel feed-forward encoder-decoder network architecture that …
Based on the analogy between knots and primes, J. Hillman, D. Matei and M. Morishita defined the Iwasawa invariants for sequences of cyclic covers of links with an analogue of Iwasawa's class number formula of number fields. In this paper, we consider the existence of covers of links with prescribed Iwasawa invariants,…
We give upper bounds of the Matveev complexities of two-bridge link complements by constructing their spines explicitly. In particular, we determine the complexities for an infinite sequence of two-bridge links corresponding to the continued fractions of the form [2,1,...,1,2]. We also give upper bounds for the 3-manif…
Let G be either a finite cyclic group of prime order or S^1. We find new relations between cohomology of a manifold (or a Poincare duality space) M with a G-action on it and cohomology of the fixed point set, M^G. Our main tool is the notion of Poincare duality on the Leray spectral sequence of the map M_G -> BG. We ap…
The paper examines special Q-nets that terminate after a finite number of Laplace steps.
Improved algorithms for stochastic linear bandits using tighter confidence sequences.
In this paper, we solve a logarithmic -equation on a compact Kähler manifold associated to a smooth divisor by using the cyclic covering trick. As applications, we discuss the closedness of logarithmic forms, injectivity theorems and obtain a kind of degeneration of spectral sequence at , and we al…
In this paper, we introduce a sequence of invariants of a knot K in S^3: the knot Floer homology groups of the preimage of K in the m-fold cyclic branched cover over K. We exhibit the knot Floer homology in the m-fold branched cover as the categorification of a multiple of the Turaev torsion in the case where the m-fol…
Study develops curvature for contact-sequence networks, revealing temporal dynamics.
Paper constructs a transfer map for codimension 2 submanifolds in higher index theory.
This paper introduces 'General Cyclical Training' for neural networks.
Emerging economies use countercyclical policies to manage crises and dominant currencies.
The paper generalizes cyclic metrics in homogeneous Finsler geometry.
Long Short-Term Memory (LSTM) is a recurrent neural network (RNN) architecture that has been designed to address the vanishing and exploding gradient problems of conventional RNNs. Unlike feedforward neural networks, RNNs have cyclic connections making them powerful for modeling sequences. They have been successfully u…
The celebrated Sequence to Sequence learning (Seq2Seq) technique and its numerous variants achieve excellent performance on many tasks. However, many machine learning tasks have inputs naturally represented as graphs; existing Seq2Seq models face a significant challenge in achieving accurate conversion from graph form …