arXiv research

Neural network outperforms traditional methods in chaotic dynamics classification.

Analyzes how quadratic differential trajectories change with variation, proving a wall-crossing formula.

Study on estimating unstable open-loop matrices from state trajectories.

Study of manifolds with prime cyclic group actions and curvature properties.

We generalize a class of groups introduced by Herbert Abels to produce examples of virtually torsion free groups that have Bredon-finiteness length m-1 and classical finiteness length n-1 for all 0 < m <= n. The proof illustrates how Bredon-finiteness properties can be verified using geometric methods and a version of …

Paper calculates Donaldson-Thomas invariants for a specific category.

We give an overview about finiteness properties of soluble S-arithmetic groups. Both, the number field case and the function field case are covered. The main result is: If B is a Borel subgroup in a Chevalley group and R is an S-arithmetic ring, then the group B(R) has finiteness length |S|-1 in the function field case…

In these notes we determine the finiteness length of the groups G(O_S) where G is an F_q-isotropic, connected, noncommutative, almost simple F_q-group and O_S is one of F_q[t], F_q[t^{-1}], and F_q[t,t^{-1}]. That is, k = F_q(t) and S contains one or both of the places s_0 and s_\infty corresponding to the polynomial p…

We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pur…

The paper extends a theorem to number fields without infinite places.

For a Jordan domain in the plane the length metric space of points connected to an interior point by a curve of finite length is a CAT(0)space and Gromov hyperbolic. With respect to the cone topology, that space plus its boundary at infinity is topologically the same as the original Jordan domain.

Recently, a framework for application-oriented optimal experiment design has been introduced. In this context, the distance of the estimated system from the true one is measured in terms of a particular end-performance metric. This treatment leads to superior unknown system estimates to classical experiment designs bas…

In a previous work we proved the uniqueness and functoriality of primary unfoldings on simple Thom-Mather spaces, which is a functor to the category of smooth manifolds. In this article we extend these results for any stratified Thom-Mather pseudomanifold with arbitary finite length, through a new kind of intermediate …

For a compact manifold, which has a part isometric to a cylinder of finite length, we consider an adiabatic limit procedure, in which the length of the cylinder tends to infinity. We study the asymptotic of the spectrum of Hodge-Laplacian and the asymptotic of the $L^2$-metric on de Rham cohomology. As an application, …

The spectral gap $γ$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to a fixed time $n$ may be observed. We consider here the problem of estimating $γ$ fro…

We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our constructions will yield Cohen-Macauley complexes provided the underlying complexes are Co…

Higher-order optimization problems naturally appear when investigating the effects of a patent with finite length, as in the pioneering work of Futagami and Iwaisako (2007). In this paper, we establish the Euler equations and transversality conditions necessary for analyzing such higher-order optimization problems. We …

We show that the finiteness length of an $S$-arithmetic subgroup $Γ$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places in $S$. This determines the finiteness properties for arithmetic subgroups in isotro…

The purpose of this note is to present a short elementary proof of a theorem due to Faltings and Laumon, saying that the global nilpotent cone is a Lagrangian substack in the cotangent bundle of the moduli space of G-bundles on a complex compact curve. This result plays a crucial role in the Geometric Langlands program…

We propose a method for inferring the conditional indepen- dence graph (CIG) of a high-dimensional discrete-time Gaus- sian vector random process from finite-length observations. Our approach does not rely on a parametric model (such as, e.g., an autoregressive model) for the vector random process; rather, it only assu…

Let G(O_S) be an S-arithmetic subgroup of a connected, absolutely almost simple linear algebraic group G over a global function field K. We show that the sum of local ranks of G determines the homological finiteness properties of G(O_S) provided the K-rank of G is 1. This shows that the general upper bound for the fini…

We formulate and analyze a graphical model selection method for inferring the conditional independence graph of a high-dimensional nonstationary Gaussian random process (time series) from a finite-length observation. The observed process samples are assumed uncorrelated over time and having a time-varying marginal dist…

Here we present a novel approach to statistical analysis of financial time series. The approach is based on $n$-grams frequency dictionaries derived from the quantized market data. Such dictionaries are studied by evaluating their information capacity using relative entropy. A specific quantization of (originally conti…

Pulli kolam is a ubiquitous art form in south India. It involves drawing a line looped around a collection of dots (pullis) place on a plane such that three mandatory rules are followed: all line orbits should be closed, all dots are encircled and no two lines can overlap over a finite length. The mathematical foundati…

The Jacobian Conjecture is proven for all Jacobian maps.

We prove stability and exponential convergence of the Perfectly Matched Layer (PML) method for acoustic scattering on manifolds with axial analytic quasicylindrical ends. These manifolds model long-range geometric perturbations (e.g. bending or stretching) of tubular waveguides filled with homogeneous or inhomogeneous …

Given a hyperbolic surface $§$, a classic result of Birman and Series states that for each $K$, all complete geodesics with at most $K$ self-intersections can only pass through a certain nowhere dense, Hausdorff dimension 1 subset of $§$. We define a self-intersection function for each complete geodesic, which bounds t…

Let $Y$ be a hyperbolic surface and let $φ$ be a Laplacian eigenfunction having eigenvalue $-1/4-τ^2$ with $τ>0$. Let $N(φ)$ be the set of nodal lines of $φ$. For a fixed analytic curve $γ$ of finite length, we study the number of intersections between $N(φ)$ and $γ$ in terms of $τ$. When $Y$ is compact and $γ$ a geode…

The scaling properties of oil price fluctuations are described as a non-stationary stochastic process realized by a time series of finite length. An original model is used to extract the scaling exponent of the fluctuation functions within a non-stationary process formulation. It is shown that, when returns are measure…

We consider the problem of estimating the evolutionary history of a set of species (phylogeny or species tree) from several genes. It is known that the evolutionary history of individual genes (gene trees) might be topologically distinct from each other and from the underlying species tree, possibly confounding phyloge…

Unified approach to stability conditions on surfaces with quadratic differentials.

We study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectories which are more similar to sub-trajectories of one group and less similar to those of the other. We propose a new method called Statistica…

Paper uses deep imitation learning to predict aircraft trajectories accurately.

Pattern ensembling fills in missing or inaccurate trajectory data.

Statistical inference methods are fundamentally important in machine learning. Most state-of-the-art inference algorithms are variants of Markov chain Monte Carlo (MCMC) or variational inference (VI). However, both methods struggle with limitations in practice: MCMC methods can be computationally demanding; VI methods …

Study shows magnetic trajectories in Berger spheres are homogeneous.

Improved trajectory prediction for team sports using sparse outputs.

WS-II algorithm segments trajectories with high accuracy.

A framework clusters vehicle motion trajectories efficiently.

In this paper we propose a new parameter-free method for trajectory classification which finds the best trajectory partition and dimension combination for robust trajectory classification. Preliminary experiments show that our approach is very promising.

Generative model learns vehicle trajectory distributions for better data generalization.

Many AI problems, in robotics and other domains, are goal-directed, essentially seeking a trajectory leading to some goal state. In such problems, the way we choose to represent a trajectory underlies algorithms for trajectory prediction and optimization. Interestingly, most all prior work in imitation and reinforcemen…

We give conditions on a general stress-energy tensor T_{αβ} in a spherically symmetric black hole spacetime which are sufficient to guarantee that the black hole will contain a (spherically symmetric) marginally trapped tube which is eventually achronal, connected, and asymptotic to the event horizon. Price law decay p…

Method detects trajectory outliers using Hodge Laplacian embeddings.

Analyzing the urban trajectory in cities has become an important topic in data mining. How can we model the human mobility consisting of stay and travel from the raw trajectory data? How can we infer such a mobility model from the single trajectory information? How can we further generalize the mobility inference to ac…

Study on billiard trajectories with fixed bounces.

Representation learning of pedestrian trajectories transforms variable-length timestamp-coordinate tuples of a trajectory into a fixed-length vector representation that summarizes spatiotemporal characteristics. It is a crucial technique to connect feature-based data mining with trajectory data. Trajectory representati…

Study proves existence of expanding solutions for multiphase surfaces with regular junctions.