Related papers: Rotation-invariant web bases from hourglass plabic…
We consider the problem in determining the countable sets $\Lambda$ in the time-frequency plane such that the Gabor system generated by the time-frequency shifts of the window $\chi_{[0,1]^d}$ associated with $\Lambda$ forms a Gabor…
We introduce and study in detail an invariant of (1,1) tangles. This invariant, derived from a family of four dimensional representations of the quantum superalgebra U_q[gl(2|1)], will be referred to as the Links-Gould invariant. We find…
Geometric variations like rotation, scaling, and viewpoint changes pose a significant challenge to visual understanding. One common solution is to directly model certain intrinsic structures, e.g., using landmarks. However, it then becomes…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…
Detecting distributional drift in high-dimensional data streams presents fundamental challenges: global comparison methods scale poorly, projection-based approaches lose geometric structure, and re-clustering methods suffer from identity…
We describe algorithms for computing geometric invariants for Hilbert modular surfaces, and we report on their implementation.
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
Graph neural networks have emerged as a powerful tool for learning spatiotemporal interactions. However, conventional approaches often rely on predefined graphs, which may obscure the precise relationships being modeled. Additionally,…
Probabilistic dependency graphs (PDGs) are a flexible class of probabilistic graphical models, subsuming Bayesian Networks and Factor Graphs. They can also capture inconsistent beliefs, and provide a way of measuring the degree of this…
We apply the method of orbit harmonics to the set of break divisors and orientable divisors on graphs to obtain the central and external zonotopal algebras respectively. We then relate a construction of Efimov in the context of…
Hydrodynamic surfaces are solutions of hydrodynamic type systems viewed as non-parametrized submanifolds of the hodograph space. We propose an invariant differential-geometric characterization of hydrodynamic surfaces by expressing the…
We calculate the Seiberg-Witten invariants of branched covers of prime degree, where the branch locus consists of embedded spheres. Aside from the formula itself, our calculations give rise to some new constraints on configurations of…
An input-output model for networks with link uncertainty is developed. The main result presents a set of integral quadratic constraints (IQCs) that collectively imply robust stability of the uncertain network dynamics. The model dependency…
A deformation of the canonical algebra for kinematical observables of the quantum field theory in Minkowski space-time has been considered under the condition of Lorentz invariance. A relativistic invariant algebra obtained depends on…
For a two-dimensional surface in the four-dimensional Euclidean space we introduce an invariant linear map of Weingarten type in the tangent space of the surface, which generates two invariants k and kappa. The condition k = kappa = 0…
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the…
The paper describes and classifies hexagonal circular 3-webs on unit sphere such that the polar points of the web circles lie on a twisted cubic, thus completing classification of hexagonal circular 3-webs with algebraic polar curves of…
A group invariant for links in thickened closed orientable surfaces is studied. Associated polynomial invariants are defined. The group detects nontriviality of a virtual link and determines its virtual genus.
A dynamical classification of the cosmic web is proposed. The large scale environment is classified into four web types: voids, sheets, filaments and knots. The classification is based on the evaluation of the deformation tensor, i.e. the…