arXiv research

Counted essential surfaces in a knot's exterior, finding a unique pattern.

Generative model identifies temporal count data components with regime-dependent contributions.

Method counts connected 2D stratifolds with singular curves and components.

Counting hyperbolic multi-geodesics with individual component lengths.

New algebra counts components of arborescent knots and links.

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…

Counting HCMU sphere components using weighted trees.

FMM fails to accurately determine the number of components even with consistent posterior.

Estimates surface count with prescribed foliations.

We introduce multi-tribrackets, algebraic structures for region coloring of diagrams of knots and links with different operations at different kinds of crossings. In particular we consider the case of component multi-tribrackets which have different tribracket operations at single-component crossings and multi-componen…

Study identifies contagion in aggregated defaults despite environmental changes.

Count data take on non-negative integer values and are challenging to properly analyze using standard linear-Gaussian methods such as linear regression and principal components analysis. Generalized linear models enable direct modeling of counts in a regression context using distributions such as the Poisson and negati…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface with any genus and number of boundary components. If only bigons are allowed, t…

The study counts arcs on hyperbolic surfaces, providing asymptotic growth formulas.

Flow Matching for count data improves sample quality and efficiency.

Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of…

Continuing the program of math.SG/0012067 and math.SG/0310450, we introduce refinements of the Donaldson-Smith standard surface count which are designed to count nodal pseudoholomorphic curves and curves with a prescribed decomposition into reducible components. In cases where a corresponding analogue of the Gromov-Tau…

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we present simple formulas for an infinite family of invariants in terms of counting su…

For a semisimple real Lie group $G$, we study topological properties of moduli spaces of polystable parabolic $G$-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…

We present an efficient algorithm for calculating the number of components of an integral lamination on an $n$-punctured disk, given its Dynnikov coordinates. The algorithm requires $O(n^2M)$ arithmetic operations, where $M$ is the sum of the absolute values of the Dynnikov coordinates.

A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain combinatorial types. These formulas generalize the calculation of a linking number by coun…

Survey on Higgs bundle moduli spaces and their connected components.

We study the quandle counting invariant for a certain family of finite quandles with trivial orbit subquandles. We show how these invariants determine the linking number of classical two-component links up to sign.

CANN models improve insurance claim count predictions using telematics data.

Study counts and parametrizes flag components in SO0(p,q) space.

Count data, for example the number of observed cases of a disease in a city, often arise in the fields of healthcare analytics and epidemiology. In this paper, we consider performing regression on multivariate data in which our outcome is a count. Specifically, we derive log-likelihood functions for finite mixtures of …

Warped DLMs improve forecasting for count time series.

Characterizes components of representations space for punctured surfaces.

We generalize the classical Beauville-Narasimhan-Ramanan correspondence to the case of parabolic Higgs bundles with regular singularities and Higgs $V$-bundles. Using this correspondence along with Bott-Morse theoretic techniques we provide an exact component count for moduli spaces of maximal parabolic $\text{Sp}\left…

Counting geodesics on compact symmetric spaces using orbit dimensions and topological data.

Study on moduli spaces of negatively curved metrics on surfaces.

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere (spherical curves), extending results by Arnold and followers. Different options wh…

Extends Benard-Conway invariant to all two-component links.

Due to the limited resources and the scale of the graphs in modern datasets, we often get to observe a sampled subgraph of a larger original graph of interest, whether it is the worldwide web that has been crawled or social connections that have been surveyed. Inferring a global property of the original graph from such…

Performance of nuclear threat detection systems based on gamma-ray spectrometry often strongly depends on the ability to identify the part of measured signal that can be attributed to background radiation. We have successfully applied a method based on Principal Component Analysis (PCA) to obtain a compact null-space m…

For a fixed compact Riemann surface X, of genus at least 2, we count the number of connected components of the moduli space of maximal Higgs bundles over X for the hermitian groups $PSp(2n,R)$, $PSO^*(2n)$, $PSO_0(2,n)$ and $E_6^{-14}$. Hence the same result follows for the number of connected components of the moduli …

Study how nodal domains change on surfaces under perturbations.

New test detects differences in heterogeneous datasets.

Milnor's triple linking numbers of a link in the 3-sphere are interpreted geometrically in terms of the pattern of intersections of the Seifert surfaces of the components of the link. This generalizes the well known formula as an algebraic count of triple points when the pairwise linking numbers vanish.

A new algorithm identifies interpretable network representations via subgraph count statistics.

Some connected components of a moduli space are mundane in the sense that they are distinguished only by obvious topological invariants or have no special characteristics. Others are more alluring and unusual either because they are not detected by primary invariants, or because they have special geometric significance…

Non-negative tensor factorization models enable predictive analysis on count data. Among them, Bayesian Poisson-Gamma models can derive full posterior distributions of latent factors and are less sensitive to sparse count data. However, current inference methods for these Bayesian models adopt restricted update rules f…

New ZIPLN model accounts for zero-inflation in multivariate count data.

The paper counts ends of differential forms on surfaces.

We study the problem of online path learning with non-additive gains, which is a central problem appearing in several applications, including ensemble structured prediction. We present new online algorithms for path learning with non-additive count-based gains for the three settings of full information, semi-bandit and…

A fast method estimates Gaussian mixture components without iterative fitting.

Proposes a new DNN framework for count data with high-cardinality features.

Let $D^-$ and $D^+$ be properly immersed closed locally convex subsets of a Riemannian manifold with pinched negative sectional curvature. Using mixing properties of the geodesic flow, we give an asymptotic formula as $t\to+\infty$ for the number of common perpendiculars of length at most $t$ from $D^-$ to $D^+$, count…