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.

169,042 papers · 148 categories

Trend · papers per month

4048071,2111,614 · Jun 202019922001200920172026
48 results for sets from submonoids

Let XX be a topological space and f:XXf:X\to X a bijection. Let C(X,f){\mathcal C}(X,f) be a set of integers such that an integer nn is an element of C(X,f){\mathcal C}(X,f) if and only if the bijection fn:XXf^n:X\to X is continuous. A subset SS of the set of integers Z{\mathbb Z} is said to be realizable if there is a topologi…

2013-10-07abs ↗pdf ↗

Based on the recent work \cite{PII} we put forward a new type of transformation for Lorentzian manifolds characterized by mapping every causal future-directed vector onto a causal future-directed vector. The set of all such transformations, which we call causal symmetries, has the structure of a submonoid which contain…

2003-03-05abs ↗pdf ↗

We study algebraic structures of certain submonoids of the monoid of homology cylinders over a surface and the homology cobordism groups, using Reidemeister torsion with non-commutative coefficients. The submonoids consist of ones whose natural inclusion maps from the boundary surfaces induce isomorphisms on higher sol…

2011-08-30abs ↗pdf ↗

The paper studies submonoids of singular twisted virtual braids and their properties.

problem Examining submonoids within singular twisted virtual braid monoid.
method Established epimorphisms, identified generators and defining relations, constructed other epimorphisms.
result Identified generators and defining relations for STVPnSTVP_n and other submonoids.

We define a new type of transformation for Lorentzian manifolds characterized by mapping every causal future-directed vector onto a causal future-directed vector. The set of all such transformations, which we call causal symmetries, has the structure of a submonoid. Some of their properties are investigated and we give…

2002-11-29abs ↗pdf ↗

The paper provides coordinates for mSL3{ m SL}_3-web diagrams on surfaces.

problem Quantizing the mSL3{ m SL}_3 character variety of closed surfaces.
method Introducing explicit coordinates for non-elliptic web diagrams in terms of a submonoid of Zd\mathbb Z^{d}.
result Explicit coordinates for non-elliptic web diagrams on a closed surface yield a parametrization by a submonoid of Zd\mathbb Z^{d}, with dimensions matching the character variety.

We fully develop the concept of causal symmetry introduced in Class. Quant. Grav. 20 (2003) L139. A causal symmetry is a transformation of a Lorentzian manifold (V,g) which maps every future-directed vector onto a future-directed vector. We prove that the set of all causal symmetries is not a group under the usual comp…

2003-08-28abs ↗pdf ↗

We describe the moduli space of extensions in the model category of simplicial presheaves. This article can be seen as a generalization of Blomgren-Chacholski results in the case of simplicial sets. Our description of the moduli space of extensions treat the equivariant and the nonequivariant case in the same setting. …

2012-11-20abs ↗pdf ↗

The monoids of simplicial endomorphisms, i.e. the monoids of endomorphisms in the simplicial category, are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations where an endofunctor is adjoint to itself, so the monoids of simplicial endomorphi…

2003-01-25abs ↗pdf ↗

The paper defines cyclic sets from ribbon string links and connects them to quantum invariants.

problem Defining and relating cyclic sets from ribbon string links.
method Endowing ribbon string links with cyclic and cocyclic structures, relating to coend of a ribbon category via quantum invariants.
result Established a relationship between ribbon string links and quantum invariants.

SCHA-VAE generates novel data from limited examples using hierarchical context aggregation.

problem Generating data from a novel distribution with limited examples.
method Hierarchical context aggregation with attention-based point to set-level aggregation.
result Hierarchical approach better captures intrinsic variability in small data.

We study the limit set of discrete subgroups arising from Anosov representations. Specially we study the limit set of discrete groups arising from strictly convex real projective structures and Anosov representations from a finitely generated word hyperbolic group into a semisimple Lie group.

2012-12-04abs ↗pdf ↗

MAGIC generates image collages from set templates using attention and set representations.

problem Generating image collages from set templates is challenging for classical models.
method Memory Attentive Generation of Image Collages (MAGIC) using Set-Transformer layers and set-pooling.
result MAGIC can generate image collages from set templates in one forward pass.

The paper sets sample complexity bounds for identifying LTI systems from a finite set.

problem Identifying an LTI system from a finite set of possible systems using trajectory data.
method Maximum likelihood estimator and information theory tools.
result Upper and lower bounds for sample complexity are derived, independent of stability assumption.

Study reveals differences in label shift problem difficulty in supervised vs. unsupervised settings.

problem Label shift problem in non-parametric classification.
method Analysis of minimax rates in supervised and unsupervised settings, focusing on class conditional distributions estimation.
result A class proportion estimation approach is minimax rate-optimal in the unsupervised setting.

Study conformal invariants from nodal sets on manifolds with boundary.

problem Understanding conformal invariants from nodal sets and eigenvalues on manifolds with boundary.
method Analysis of conformal covariant operators and eigenvalues on manifolds with boundary.
result Relate Dirichlet and Neumann eigenvalues and apply results to curvature prescription problems.

An important question that discrete approaches to quantum gravity must address is how continuum features of spacetime can be recovered from the discrete substructure. Here, we examine this question within the causal set approach to quantum gravity, where the substructure replacing the spacetime continuum is a locally f…

2006-04-28abs ↗pdf ↗

Unified probabilistic foundation for fuzzy simplicial sets in dimensionality reduction.

problem Lack of clear probabilistic interpretation in fuzzy simplicial sets.
method Introducing a probabilistic framework explaining fuzzy simplicial sets as marginals of probability measures on simplicial sets.
result Unified probabilistic theoretical foundation for fuzzy simplicial sets.

Maps sets to probability distributions to minimize information loss.

problem Learning to map sets to probability distributions to preserve information.
method Relates set operations to probability distribution interpolations and demonstrates a preliminary solution.
result Experimental results show the effectiveness of the set embedding approach.

The purpose of this paper is to outline a simple set of axioms for basic set theory from which most fundamental facts can be derived. The key to the whole project is a new axiom of set theory which I dubbed "The Law of Extremes". It allows for quick proofs of basic set-theoretic identities and logical tautologies, so i…

2013-05-14abs ↗pdf ↗

Smooths metrics with nonnegative scalar curvature near singular sets.

problem Approximating metrics with nonnegative scalar curvature near singularities.
method Ricci-DeTurck flow to approximate metrics.
result Approximated metrics converge to the original metric in CC^\infty away from the singular set.

Paper improves Bayesian network learning from related data sets.

problem Learning from heterogeneous data sets with different probabilistic structures.
method Mixed-effects models to pool information across related data sets.
result Mixed-effects models outperform traditional methods in accuracy.

New tighter bounds for learning algorithms from Steinke & Zakynthinou's supersample setting.

problem Improving generalization bounds for machine learning algorithms.
method Information-theoretic approach using projected loss and Rademacher sequence.
result The new bounds are tighter than previous information-theoretic bounds.

Simple conditions for comonotonic additive risk measures from acceptance sets.

problem Conditions for comonotonic additive risk measures from acceptance sets.
method Conditions on acceptance sets for induced comonotonic additive risk measures.
result Acceptance sets induce comonotonic additive risk measures if and only if the acceptance sets and their complements are stable under convex combinations of comonotonic random variables.

Nilpotent Lie algebras obtained from ordered sets and quivers are algebraic Ricci solitons.

problem Constructing nilpotent Lie algebras as algebraic Ricci solitons
method Using transitively and antisymmetrically ordered sets (TAOSs) and incidence algebras
result Nilpotent Lie algebras with arbitrarily high degrees of nilpotency are algebraic Ricci solitons

This paper is devoted to the development and applications of some (new) basic concepts in Lie theory, both from `computational" and "observability" viewpoint. We specify set of all "G-equivariant" maps from a given Lie group G to the underlying manifold M, namely GG-set, and also we introduce "conjugacy" in Lie group …

2012-01-18abs ↗pdf ↗

In this paper, we construct an infinite presentation of the Torelli subgroup of the mapping class group of a surface whose generators consist of the set of all "separating twists", all "bounding pair maps", and all "commutators of simply intersecting pairs" and whose relations all come from a short list of topological …

2007-03-19abs ↗pdf ↗

We show that the asymptotic growth rate for the minimal cardinality of a set of simple closed curves on a closed surface of genus gg which fill and pairwise intersect at most K1K\ge 1 times is 2g/K2\sqrt{g}/\sqrt{K} as gg \to \infty . We then bound from below the cardinality of a filling set of systoles by g/log(g)g/\log(g).…

2009-09-10abs ↗pdf ↗

It it known that the set of L-space surgeries on a nontrivial L-space knot is always bounded from below. However, already for two-component torus links the set of L-space surgeries might be unbounded from below. For algebraic two-component links we provide three complete characterizations for the boundedness from below…

2015-09-03abs ↗pdf ↗