arXiv research

Counts minimal tori in Riemannian manifolds with 6 or more dimensions.

Proposes a robust EM algorithm for analyzing incomplete panel count data.

Proposes a method to reconcile count time series forecasts.

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

Study geodesic paths on flat surfaces, comparing length and singularity counts.

Constructs a function to count closed geodesics on Riemannian manifolds.

We prove formulae for the countings by orbit of square-tiled surfaces of genus two with one singularity. These formulae were conjectured by Hubert & Lelièvre. We show that these countings admit quasimodular forms as generating functions.

This paper was motivated by work of Arnold where he explains how to count "snakes", i.e. Morse functions on the real axis with prescribed behavior at infinity. This leads immediately to a count of excellent Morse functions on the circle, where following Thom's terminology, excellent means that no two critical points li…

Graph neural networks struggle with counting certain substructures in graphs.

Let $P$ be a non-negative self-adjoint Laplace type operator acting on sections of a hermitian vector bundle over a closed Riemannian manifold. In this paper we review the close relations between various $P$-related coefficients such as the mollified spectral counting coefficients, the heat trace coefficients, the reso…

New bootstraps improve speed and accuracy for graph count functionals.

Upper bound found for Steklov eigenvalues counting function.

We construct convergent and divergent lattices in negative curvature and give a precise asymptotic description of the behavior of their counting function.

Study counts minimal Lagrangians in hyperbolic surfaces with precise growth rate.

Enhances psyquandle counting invariants using cocycles.

This work refines Cover's theory for binary classification on low-dimensional data.

The paper computes special values of combinatorial zeta functions to reveal topological properties of manifolds.

In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many configurations of disjoint arcs are there on $S$ whose boundary is $F$? We find that thi…

We study the counting function of topological Poincaré series associated with rational homology sphere plumbed 3-manifold with connected negative definite tree, interpreting as an alternating sum of coefficient functions associated with some Taylor expansions. It is motivated by a theorem of Szenes and Vergne which exp…

The counting function on the natural numbers defines a discrete Morse-Smale complex with a cohomology for which topological quantities like Morse indices, Betti numbers or counting functions for critical points of Morse index are explicitly given in number theoretical terms. The Euler characteristic of the Morse filtra…

The paper introduces neural INGARCH models for time series of counts.

The aim of this (mostly expository) article is twofold. We first explore a variety of length functions on the space of currents, and we survey recent work regarding applications of length functions to counting problems. Secondly, we use length functions to provide a proof of a folklore theorem which states that pseudo-…

We study the combinatorial geometry of "lattice" Jenkins--Strebel differentials with simple zeroes and simple poles on $\mathbb{C}P^1$ and of the corresponding counting functions. Developing the results of M. Kontsevich we evaluate the leading term of the symmetric polynomial counting the number of such "lattice" Jenki…

Counting essential surfaces in 3-manifolds yields concise formulae and detailed asymptotics.

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones fun…

Better neural arithmetic logic units improve cell counting model generalization.

New tree-structured Markov fields with Poisson marginals for counting variables.

The Poincare function is a compact form of counting moduli in local geometric problems. We discuss its property in relation to V.Arnold's conjecture, and derive this conjecture in the case when the pseudogroup acts algebraically and transitively on the base. Then we survey the known counting results for differential in…

Networks are a fundamental tool for modeling complex systems in a variety of domains including social and communication networks as well as biology and neuroscience. Small subgraph patterns in networks, called network motifs, are crucial to understanding the structure and function of these systems. However, the role of…

A method to construct fractal surfaces by recurrent fractal curves is provided. First we construct fractal interpolation curves using a recurrent iterated functions system(RIFS) with function scaling factors and estimate their box-counting dimension. Then we present a method of construction of wider class of fractal su…

Study on braids' invariant growth and counting functions.

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

Sketching is a randomized dimensionality-reduction method that aims to preserve relevant information in large-scale datasets. Count sketch is a simple popular sketch which uses a randomized hash function to achieve compression. In this paper, we propose a novel extension known as Higher-order Count Sketch (HCS). While …

We obtain asymptotic counting results with error terms for complex orthospectrum for Schottky groups and orbit counting function for quadratic polynomials. Moreover, we prove equidistribution of holonomy associated to these dynamical systems. Our results are obtained by considering generalized $L$-functions coming from…

We prove the quasimodularity of generating functions for counting torus covers, with and without Siegel-Veech weight. Our proof is based on analyzing decompositions of flat surfaces into horizontal cylinders. The quasimodularity arise as contour integral of quasi-elliptic functions. It provides an alternative proof of …

We present the first framework for Gaussian-process-modulated Poisson processes when the temporal data appear in the form of panel counts. Panel count data frequently arise when experimental subjects are observed only at discrete time points and only the numbers of occurrences of the events between subsequent observati…

New method calculates DMN log-likelihood faster.

Study counts geodesics on modular surface, linking to necklace counting.

Graphical estimation of count time series dependencies.

New phases identified in neural scaling laws with compute limits.

Bayesian model for discrete data with conditional transformations.

We prove the equidistribution of (weighted) periodic orbits of the geodesic ow on noncompact negatively curved manifolds toward equilibrium states in the narrow topology, i.e. in the dual of bounded continuous functions. We deduce an exact asymptotic counting for periodic orbits (weighted or not), which was previously …

The study counts periodic orbits on smooth manifolds, adding ghost orbits for completeness.

Warped DLMs improve forecasting for count time series.

Counting tripods on a flat torus using lattice point counting.

Let $(M, {g})$ be a compact, $d$-dimensional Riemannian manifold without boundary. Suppose further that $(M,g)$ is either two dimensional and has no conjugate points or $(M,g)$ has non-positive sectional curvature. The goal of this note is to show that the long time parametrix obtained for such manifolds by Bérard can …

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 …

A new complexity measure for neural networks improves upon classical methods.