We describe unicorn paths in the arc graph and show that they form 1-slim triangles and are invariant under taking subpaths. We deduce that all arc graphs are 7-hyperbolic. Considering the same paths in the arc and curve graph, this also shows that all curve graphs are 17-hyperbolic, including closed surfaces.
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,657 papers · 148 categories
Trend · papers per month
48 results for “slim triangles”
Uniform bound on geodesic images for surfaces using bicorn curves.
problem Bounding geodesic images on closed surfaces.
method Utilizing bicorn curves and properties of 1-slim triangles.
result Uniform bound of 44 for non-annular subsurfaces, 3 for specific cases.
We introduce Supersparse Linear Integer Models (SLIM) as a tool to create scoring systems for binary classification. We derive theoretical bounds on the true risk of SLIM scoring systems, and present experimental results to show that SLIM scoring systems are accurate, sparse, and interpretable classification models.
Study on weakly G-slim complexes and non-positive immersions for group presentations.
problem Conditions for non-positive immersions in group presentations.
method Investigation of weakly G-slim complexes and their relationship to left-orderable groups.
result Conditions on generalized Wirtinger presentations guaranteeing non-positive immersions for their associated 2-complexes.
SLIM efficiently solves overidentified models in a scalable manner.
problem Overidentified models with many moment conditions.
method Stochastic approximation framework using mini-batches and unbiased updates.
result SLIM solves overidentified models in under 1.4 hours, compared to 18 hours for full-sample GMM.
On slim double Lie groupoidsmath.DG
We prove that every slim double Lie groupoid with proper core action is completely determined by a factorization of a certain canonically defined "diagonal" Lie groupoid.
Slim curves on 3-sphere help spherical CR uniformizations.
problem Understanding curves on 3-sphere for CR uniformizations.
method Defining slimness, analyzing foliations, and applying to quasi-Fuchsian groups.
result Slim curves lead to spherical CR uniformizations of certain 3-manifolds.
Scoring systems are linear classification models that only require users to add, subtract and multiply a few small numbers in order to make a prediction. These models are in widespread use by the medical community, but are difficult to learn from data because they need to be accurate and sparse, have coprime integer co…
In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully Bayesian hierarchy for …
Scoring systems are classification models that only require users to add, subtract and multiply a few meaningful numbers to make a prediction. These models are often used because they are practical and interpretable. In this paper, we introduce an off-the-shelf tool to create scoring systems that both accurate and inte…
Bi-Lipschitz rigidity theorem for dense subgroups of algebraic groups.
problem Characterizing dense subgroups of algebraic groups.
method Bi-Lipschitz rigidity theorem for Zariski dense discrete subgroups.
result No -smooth slim limit set for higher rank semisimple algebraic groups.
Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classificationcs.LG
SLIM model tackles graph classification by resolving part-interaction dilemmas.
problem Difficulty in modeling graph parts and their interactions in graph classification.
method SLIM model, which solves resolution dilemmas and leverages explicit interactions.
result SLIM offers improved interpretability, accuracy, and new insights in graph representation learning.
New method for mixed memberships using symmetrized Laplacian inverse matrix.
problem Mixed memberships in community detection.
method Spectral clustering on symmetrized Laplacian inverse matrix.
result Mixed-SLIM methods outperform state-of-the-art methods.
Unified framework compresses GANs up to 47x with minimal quality loss.
problem High parameter complexity of GANs for resource-constrained devices.
method Unified optimization framework combining model distillation, channel pruning, and quantization.
result 47x compression of CartoonGAN with minimal quality degradation.
We model leverage as stochastic but independent of return shocks and of volatility and perform likelihood-based inference via the recently developed iterated filtering algorithm using S&P500 data, contributing new evidence to the still slim empirical support for random leverage variation.
Let be a Garside group with Garside element , and let be the minimal positive central power of . An element is said to be 'periodic' if some power of it is a power of . In this paper, we study periodic elements in Garside groups and their conjugacy classes. We show that the periodicity of an…
Simplified LSTM models improve sentiment analysis on Twitter debate data.
problem Performing sentiment analysis on long sequence data from Twitter debates.
method Developed six parameter-reduced LSTM models (slim LSTM) for faster training and reduced computational cost.
result Slim LSTM models outperform standard LSTM model in sentiment analysis of GOP Debate Twitter dataset.
Napoleonic triangles don't exist in hyperbolic geometry.
problem The existence of Napoleonic triangles in hyperbolic geometry.
method Analyzing the construction of equilateral triangles on hyperbolic triangles.
result Hyperbolic triangles do not form Napoleonic triangles, except equilateral ones.
New bounds on inscribed triangles in arbitrary planar domains.
problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.
Paper calculates eigenvalues of a specific triangle on a sphere.
problem Computing eigenvalues of a specific triangle on a sphere.
method Computed first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2) on the sphere.
result Computed the first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2).
Study on Laplacian determinant in isosceles triangles, finding equilateral triangle minimizes determinant.
problem Finding the minimum of the spectral determinant on isosceles triangles.
method Analyzing the determinant of the Laplacian on Euclidean isosceles triangle envelopes of fixed area.
result Equilateral triangle envelope minimizes the determinant of the Laplacian.
The redundancy is widely recognized in Convolutional Neural Networks (CNNs), which enables to remove unimportant filters from convolutional layers so as to slim the network with acceptable performance drop. Inspired by the linear and combinational properties of convolution, we seek to make some filters increasingly clo…
New method shows any triangle group generating pair is related to special coverings.
problem Understanding generating pairs of triangle groups.
method Special almost orbifold coverings.
result Any generating pair of a triangle group is represented by a special covering.
Complex hyperbolic triangle groups were first considered by Mostow in building the first nonarithmetic lattices in PU(2, 1). They are a natural generalization of the classical triangle groups acting on the hyperbolic plane. A well-known theorem of Takeuchi is that there are only finitely many Fuchsian triangle groups t…
Defines band maps in unoriented link Floer homology forming a skein exact triangle.
problem Understanding unoriented link Floer homology through band maps.
method Defines and analyzes band maps in unoriented link Floer homology.
result Band maps form an unoriented skein exact triangle.
Proves a new skein exact triangle for real monopole Floer homology.
problem None explicitly stated; focuses on proving a new mathematical structure.
method Introduces a new exact triangle for real monopole Floer homology.
result Proves an unoriented skein exact triangle for real monopole Floer homology.
New surgery exact triangles in Heegaard Floer homology for rational slopes.
problem Constructing new surgery exact triangles in Heegaard Floer homology.
method Combining combinatorial triangle and quadrilateral counting in genus 1 Heegaard diagrams.
result Solving the combinatorial problem for rational slopes, including tricky cases.
We answer the question "Does the Y-triangle move preserve intrinsic knottedness?" in the negative by giving an example of a graph that is obtained from the intrinsically knotted graph K_7 by triangle-Y and Y-triangle moves but is not intrinsically knotted.
Study calculates eigenvalues and eigenfunctions for spherical triangles and finds fundamental gap behavior.
problem Understanding eigenvalues and gaps in spherical triangles.
method Explicit computation of Dirichlet eigenvalues and eigenfunctions for spherical lunes and triangles.
result Fundamental gap of spherical triangles increases as the angle of the lune decreases.
Another Veech Trianglemath.GT
We show that the triangle with angles Pi/12, Pi/3 and 7*Pi/12 has the lattice property and compute this triangle's Veech group.
We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X. We construct an example of a complete path metr…
Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…
New method proves mateability of triangle groups with Blaschke products.
problem Proving mateability of triangle groups with Blaschke products.
method Associating two piecewise analytic circle maps to the triangle group, mating these with Blaschke products, and constructing a common lift.
result Proves mateability of all cusped triangle groups with suitable Blaschke products.
In this paper we study the area of ideals triangles in a convex domain with its Hilbert geometry. We obtain a characterization of the hyperbolic geometry among all the Hilbert geometry in terms of area of ideals triangles. We also obtain a sharp lower bound on the hilbert area of ideal triangles, independant of the con…
In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this paper investigates the existence of the incenter and the isogonal conjugate of a…
A formula for Rademacher symbols in triangle groups is provided.
problem No specific problem stated; focuses on a mathematical formula.
method Presentation of an explicit formula for Rademacher symbols.
result Generalizes Ghys' proof of modular knot linking numbers.
Study stabilizers of complex hyperbolic triangle groups, finding generators and signatures.
problem Understanding the stabilizers of complex hyperbolic triangle groups.
method Explicit generators and signatures of stabilizers computed for each group orbit of mirrors.
result Explicit generators and signatures of stabilizers for some triangle groups.
Criterion for stopping conjugacy class enumeration in triangle groups.
problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.
New skein exact triangles for link Floer homology.
problem Understanding link Floer homology through skein relations.
method Construction of skein triples for rational tangles.
result Established a framework for potential further skein exact triangles.
New theorem disproves Angle Defect for super triangles.
problem Angle Defect Theorem for N=1 super hyperbolic geometry.
method Action of OSp(1|2) on real super Minkowski space and brute-force computation.
result Disproves Angle Defect Theorem and provides novel additive function.
Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Modelstat.ML
SLIM model predicts social network polarization using signed links.
problem Polarization and filter bubbles in social networks.
method Signed relational Latent dIstance Model (SLIM) using Skellam distribution.
result SLIM model accurately predicts friendships and animosity in social networks.
The study examines Lipschitz normally embedded Hölder triangles in 4D space.
problem Comparing ambient and outer Lipschitz geometry of Hölder triangles.
method Analyzes Lipschitz normally embedded Hölder triangles in \(\mathbb{R}^4\).
result Infinitely many equivalence classes of microknots.
Triangle Artin groups split as graphs of free groups under specific conditions.
problem Conditions for triangle Artin groups to split as graphs of free groups.
method Graph of free groups analysis and poly-free property proof.
result Triangle Artin groups split as graphs of free groups if and only if labels are greater than 5 and even.
The paper finds extremum values for mixed Laplacian eigenvalues on triangles and trapezoids.
problem Finding extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
method Characterizations obtained under suitable geometric constraints.
result Characterizations of extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
Study on 3D surfaces and tangles formed by Poncelet triangles.
problem Geometric and topological properties of 3D surfaces and tangles.
method Exploration of Poncelet triangles and associated points.
result Properties of 3D surfaces and tangles formed by Poncelet triangles.
Study of subgroups in complex hyperbolic lattice triangle groups.
problem Characterizing subgroups of finite index in complex hyperbolic lattice triangle groups.
method Explicit construction and analysis of subgroups, examination of their properties.
result Identification of neat subgroups, subgroups with positive first Betti number, and homomorphisms onto non-Abelian free groups.
Triangle groups uniquely identified by their finite quotients.
problem Identifying triangle groups among finitely generated residually finite groups.
method Character varieties method to distinguish profinite completions.
result Certain Fuchsian triangle groups are profinitely rigid.
Study orbits in right triangles, deducing periodic billiard paths and classifying orbit closures.
problem Understanding periodic billiard paths in right triangles and orbit closures in strata of Abelian and quadratic differentials.
method Classifying orbit closures of rank at least two in hyperelliptic components of strata of Abelian and quadratic differentials.
result Computed orbit closures and deduced asymptotic number of periodic billiard trajectories in right triangles.