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

3978116155 · May 202619922001200920172026
48 results for counting distinct elements

MaxSketch improves distinct counting in high-dimensional, noisy data streams.

problem Estimating distinct elements in high-dimensional, noisy data streams.
method MaxSketch uses random Gaussian projections to estimate distinct counts.
result MaxSketch achieves (1+ε)(1+\varepsilon) factor estimation with m=O~(logn/ε2)m = \widetilde{O} (\log n/\varepsilon^2) random projections.

The paper explores privacy-preserving methods for counting unique elements in distributed settings.

problem Counting unique elements in a distributed setting while maintaining privacy.
method Analyzes and proves lower bounds for differentially private protocols in various settings.
result Achieves optimal error bounds for multi-message shuffle protocols in estimating distinct elements.

We show that if a f.g. group GG has a non-elementary WPD action on a hyperbolic metric space XX, then the number of GG-conjugacy classes of XX-loxodromic elements of GG coming from a ball of radius RR in the Cayley graph of GG grows exponentially in RR. As an application we prove that for N3N\ge 3 the number of…

2017-07-22abs ↗pdf ↗

The paper counts mapping classes by Nielsen-Thurston type, finding growth rates for different subsets.

problem Counting mapping classes in Teichmüller space with different subsets.
method Introduced complexity length to measure negative curvature of curve complexes.
result Growth rates for finite-order, reducible, and multitwists subsets.

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 ↗

We study properties of generic elements of groups of isometries of hyperbolic spaces. Under general combinatorial conditions, we prove that loxodromic elements are generic (i.e. they have full density with respect to counting in balls for the word metric) and translation length grows linearly. We provide applications t…

2017-11-11abs ↗pdf ↗

The paper counts conjugacy classes of loxodromic elements in Anosov subgroups with a power saving error term.

problem Counting conjugacy classes of loxodromic elements in Anosov subgroups.
method Interpreting Jordan projections as periods of a flow and proving exponential mixing.
result Proves a counting theorem with a power saving error term for conjugacy classes of loxodromic elements.

For suitable finite groups G, we construct contractible 4-manifolds C with an effective G-action on C\partial C whose associated pairs (C,g) for all gGg \in G are distinct smoothings of the pair (C,C)(C,\partial C). Indeed C embeds in a 4-manifold so that cutting out C and regluing using distinct elements of G yield dist…

2016-02-24abs ↗pdf ↗

The study calculates the growth rate of reciprocal hyperbolic elements in Hecke groups.

problem Counting reciprocal hyperbolic elements in Hecke groups.
method Analyzes conjugacy classes of hyperbolic elements associated with reciprocal geodesics.
result Determines the asymptotic growth rate and limiting constant of primitive conjugacy classes of reciprocal hyperbolic elements.

We describe a way of representing finite biquandles with n elements as 2n x 2n block matrices. Any finite biquandle defines an invariant of virtual knots through counting homomorphisms. The counting invariants of non-quandle biquandles can reveal information not present in the knot quandle, such as the non-triviality o…

2006-01-07abs ↗pdf ↗

The seemingly disjoint problems of count and mixture modeling are united under the negative binomial (NB) process. A gamma process is employed to model the rate measure of a Poisson process, whose normalization provides a random probability measure for mixture modeling and whose marginalization leads to an NB process f…

2012-09-15abs ↗pdf ↗

In this paper, we establish that, for statistically convex-cocompact actions, contracting elements are exponentially generic in counting measure. Among others, the following exponential genericity results are obtained as corollaries for the set of hyperbolic elements in relatively hyperbolic groups, the set of rank-1 e…

2017-07-19abs ↗pdf ↗

There are a least uncountably many diffeomorphism types for open manifolds. Hence the classification problem is extremely difficult. We proceed as follows: We define several uniform structures of proper metric spaces and consider their arc components. Any open complete manifold (M^n,g) defines such a component. Hence t…

1999-11-25abs ↗pdf ↗

We prove that a Kleinian group GG acting upon Hn\mathbb{H}^{n} admits a non-constant GG-automorphic function, even if it has torsion elements, provided that the orders of the elliptic (torsion) elements are uniformly bounded. This is accomplished by developing a technique for mashing distinct fat triangulations while…

2004-04-30abs ↗pdf ↗

The paper counts conjugacy classes of pseudo-Anosov homeomorphisms in Teichmüller space.

problem Counting conjugacy classes of pseudo-Anosov homeomorphisms in Teichmüller space.
method Analyzes the asymptotic behavior of conjugacy classes as the radius of a ball in Teichmüller space increases.
result Asymptotics for the number of pseudo-Anosov homeomorphisms conjugate to a given homeomorphism within a ball of radius R centered at X.

We compute the asymptotics, as R tends to infinity, of the number of closed geodesics in Moduli space of length at most R, or equivalently the number of pseudo-Anosov elements of the mapping class group of translation length at most R.

2008-11-14abs ↗pdf ↗

In this article, associated with each lattice TZnT\subseteq \mathbb{Z}^n the concept of a harmonic-counting measure νTν_T on a sphere Sn1S^{n-1} is introduced and it is applied to determine the asymptotic behavior of the eigenfunctions of the Laplace-Beltrami operator on a lens space. In fact, the asymptotic behavior of …

2016-02-21abs ↗pdf ↗

We count the supersymmetric bound states of many distinct BPS monopoles in N=4 Yang-Mills theories and in pure N=2 Yang-Mills theories. The novelty here is that we work in generic Coulombic vacua where more than one adjoint Higgs fields are turned on. The number of purely magnetic bound states is again found to be cons…

2000-05-30abs ↗pdf ↗

The study reveals a persistent bias in the distribution of holonomy on compact hyperbolic 3-manifolds.

problem The distribution of holonomy on compact hyperbolic 3-manifolds is not uniformly distributed.
method An asymptotic count of closed geodesics by their length and holonomy, and analysis of spectral parameters.
result A normalized, smoothed bias count of holonomy is distributed according to a probability distribution, controlled by the number of zero spectral parameters.

Central limit theorem for Green metrics on hyperbolic groups.

problem Proving a central limit theorem for Green metrics on hyperbolic groups.
method Proving a central limit theorem for Green metrics on hyperbolic groups using probability measures and ordering elements.
result Proved a central limit theorem for Green metrics on hyperbolic groups.

A hyperbolic conjugacy class in the modular group PSL(2,Z) corresponds to a closed geodesic in the modular orbifold. Some of these geodesics virtually bound immersed surfaces, and some do not; the distinction is related to the polyhedral structure in the unit ball of the stable commutator length norm. We prove the foll…

2010-03-07abs ↗pdf ↗

We tackle anomaly detection in sparse time series data.

problem Sparse time series with low signal-to-noise ratios and non-uniform performance.
method We introduce a novel generative procedure for benchmark datasets and demonstrate how anomaly score smoothing improves performance.
result Anomaly score smoothing consistently improves performance in low-count time series anomaly detection.

New method counts boundary pieces in ReLU classifiers for better complexity measure.

problem Current classification complexity measures are misleading and ineffective.
method Developed a novel method using tropical geometry to count exact boundary pieces.
result Boundary piece count is negatively correlated with robustness.

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.

In this paper, we derive an asymptotic formula for the number of conjugacy classes of elements in a class of statistically convex-cocompact actions with contracting elements. Denote by C(o,n)\mathcal C(o, n) (resp. C(o,n)\mathcal C'(o, n)) the set of (resp. primitive) conjugacy classes of pointed length at most nn for a basep…

2018-10-06abs ↗pdf ↗

We investigate the geometry of word metrics on fundamental groups of manifolds associated with the generating sets consisting of elements represented by closed geodesics. We ask whether the diameter of such a metric is finite or infinite. The first answer we interpret as an abundance of closed geodesics, while the seco…

2019-04-25abs ↗pdf ↗

We use the Yang-Mills gradient flow on the space of connections over a closed Riemann surface to construct a Morse-Bott chain complex. The chain groups are generated by Yang-Mills connections. The boundary operator is defined by counting the elements of appropriately defined moduli spaces of Yang-Mills gradient flow li…

2011-03-04abs ↗pdf ↗

Unified framework for comparing clusterings from information-theoretic and pair-counting perspectives.

problem Divergent evaluations of unsupervised models due to different clustering similarity measures.
method Developed an analytical framework that unifies pair-counting and information-theoretic clustering similarity measures.
result Unified framework clarifies when and why the two regimes diverge and provides a principled basis for selecting and interpreting clustering similarity measures.

The paper develops methods to estimate frequencies in large discrete data sets with improved coverage and robustness.

problem Estimating frequencies in large, discrete data sets with valid coverage and robustness.
method Conformal inference methods using discrete sketches, marginal coverage for queries, and novel conformal calibration.
result Improved empirical performance compared to existing methods in simulations and real data.

A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency for a covariate present in a sample to both repeat itself and excite related ones…

2016-04-25abs ↗pdf ↗

The column group is a subgroup of the symmetric group on the elements of a finite blackboard birack generated by the column permutations in the birack matrix. We use subgroups of the column group associated to birack homomorphisms to define an enhancement of the integral birack counting invariant and give examples whic…

2009-01-30abs ↗pdf ↗

For a semisimple real Lie group GG, we study topological properties of moduli spaces of polystable parabolic GG-Higgs bundles over a Riemann surface with a divisor of finitely many distinct points. For a split real form of a complex simple Lie group, we compute the dimension of apparent parabolic Teichm{ü}ller compon…

2018-06-03abs ↗pdf ↗

Let KK be a polygonal knot in general position with vertex set VV. A \emph{generic quadrisecant} of KK is a line that is disjoint from the set VV and intersects KK in exactly four distinct points. We give an upper bound for the number of generic quadrisecants of a polygonal knot KK in general position. This upper…

2015-02-10abs ↗pdf ↗

AL0\ell_0CORE tensor decomposition reduces computational cost for sparse count data.

problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with 0\ell_0-norm constraint.
result AL0\ell_0CORE achieves similar results to full Tucker decomposition at a fraction of the cost.

Characterizes components of representations space for punctured surfaces.

problem Characterizing connected components of representations space.
method Using relative Euler classes, signs of peripheral elements, and generalized Milnor-Wood inequality.
result Counted total number of connected components of type-preserving representations.