3-manifold triangulation can be reconstructed from its intersection matrix.
problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.
Algorithm counts intersections of normal curves efficiently.
problem Efficiently solving word problems in mapping class groups of punctured surfaces.
method Fast algorithm for counting intersections of normal curves on triangulated surfaces.
result Efficient solution of the word problem for mapping class groups of punctured surfaces.
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show that these weight systems are related to the weight systems induced by the Conway a…
New bounds on curves on torus with few intersections.
problem Finding the maximum number of non-homotopic curves on a torus with limited intersections.
method Analyzing the maximum size of sets of curves with at most k intersections, using combinatorial optimization techniques.
result The maximum size of such a set is k+6 for all k, and k+4 for large k.
A new method clusters intersecting lines using hypergraphs.
problem Clustering intersecting lines in subspace clustering.
method Constructing a geometric hypergraph and using spectral algorithm.
result Achieves information-theoretic bounds for line clustering.
The paper proves embedding conditions for complexes in manifolds using matrix rank criteria.
problem Embedding k-dimensional simplicial complexes into (k−1)-connected PL manifolds. method Proves embedding conditions using a skew-symmetric matrix with low rank over Q. result Embedding conditions for k-complexes in 2k-manifolds are equivalent to low-rank matrix conditions. Non-negative matrix factorization (NMF) is a natural model of admixture and is widely used in science and engineering. A plethora of algorithms have been developed to tackle NMF, but due to the non-convex nature of the problem, there is little guarantee on how well these methods work. Recently a surge of research have …
In a previous paper, we defined an operation μ that generalizes Turaev's cobracket for loops on a surface. We showed that, in contrast to the cobracket, this operation gives a formula for the minimum number of self-intersections of a loop in a given free homotopy class. In this paper we consider the corresponding que…
The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.
problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.
We investigate some geometric properties of the real algebraic variety Δ of symmetric matrices with repeated eigenvalues. We explicitly compute the volume of its intersection with the sphere and prove a Eckart-Young-Mirsky-type theorem for the distance function from a generic matrix to points in Δ. We exhibit conne…
Study of Hamiltonian flows on character varieties for self-intersecting curves.
problem Analyzing periodic orbits of Hamiltonian flows on character varieties.
method Explicit computations in Fock-Goncharov coordinates.
result Hamiltonian flows of trace functions associated to self-intersecting curves on a pair of pants have periodic orbits.
In this paper, we show that the Lie superalgebra spo(2l+2∣n) is into the intersection of Lie superalgebra of contact vector fields K(2l+1∣n) and the Lie superalgebra of projective vector fields pgl(2l+2∣n). We use mainly the embedding used by P. Mathonet and F. Radoux in "\textit{ …
Basket links are shown to be isotopic to T(2,n+1).
problem Understanding isotopy of basket links to torus links.
method Using symmetrized Seifert form congruence to An matrix. result Basket links are isotopic to T(2,n+1). Investigates linearity of group amalgams and new examples of non-linear groups.
problem Linearity of group amalgams and examples of non-linear groups.
method Investigates linearity of amalgams of subgroups of algebraic groups.
result Establishes linearity of certain 'doubles' of linear groups and finds new non-linear examples.
New method reduces computational cost for nonnegative low rank matrix approximation.
problem Efficiently compute nonnegative low rank matrix approximation for nonnegative matrices.
method Alternating projections onto tangent spaces of fixed rank matrices manifold and nonnegative matrix manifold.
result Sequence converges linearly to optimal solutions, showing better performance in terms of computational time and accuracy.
BEGIN network models binary data without parametric assumptions.
problem Conditional independence in non-parametric families of binary data.
method BEGIN network models binary data using sparse linear representations and block factorizations.
result BEGIN network captures conditional independence for arbitrary binary and multinomial variables.
The increasing size and complexity of scientific data could dramatically enhance discovery and prediction for basic scientific applications. Realizing this potential, however, requires novel statistical analysis methods that are both interpretable and predictive. We introduce Union of Intersections (UoI), a flexible, m…
This paper concerns cluster algebras with principal coefficients A(S,M) associated to bordered surfaces (S,M), and is a companion to a concurrent work of the authors with Schiffler [MSW2]. Given any (generalized) arc or loop in the surface -- with or without self-intersections -- we associate an element of (the fractio…
Differential Cohomotopy theory predicts brane interactions via chord diagrams.
problem Quantization of brane charges and moduli spaces.
method Differential refinement of Cohomotopy theory, configuration spaces, chord diagrams.
result Higher observables on brane moduli spaces are given by weight systems on chord diagrams.
Knots and 4-manifolds linked via matrix kinking.
problem Understanding equivalence of symmetric matrices and their implications.
method Isotopy and kinking moves on Goeritz matrices.
result Every nonsingular symmetric integer matrix is kink-equivalent to positive or negative-definite matrices.
Traffic signal control has long been considered as a critical topic in intelligent transportation systems. Most existing learning methods mainly focus on isolated intersections and suffer from inefficient training. This paper aims at the cooperative control for large scale multi-intersection traffic signal, in which a …
Given a matrix the seriation problem consists in permuting its rows in such way that all its columns have the same shape, for example, they are monotone increasing. We propose a statistical approach to this problem where the matrix of interest is observed with noise and study the corresponding minimax rate of estimatio…
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…
New method for triclustering with reduced arbitrariness.
problem Need for reduced arbitrariness in specifying cluster size.
method Spectral decomposition of tensor slices and intersection of clusters.
result Effective triclustering on synthetic and real-world data.
Tensor networks improve anomaly detection at LHC for new physics.
problem Identifying new phenomena in proton collision events at LHC.
method Tensor network-based anomaly detection using Matrix Product State with an isometric feature map.
result Tensor networks outperform established quantum methods in identifying new phenomena.
We develop a family of reformulations of an arbitrary consistent linear system into a stochastic problem. The reformulations are governed by two user-defined parameters: a positive definite matrix defining a norm, and an arbitrary discrete or continuous distribution over random matrices. Our reformulation has several e…
To each ribbon graph we assign a so-called L-space, which is a Lagrangian subspace in an even-dimensional vector space with the standard symplectic form. This invariant generalizes the notion of the intersection matrix of a chord diagram. Moreover, the actions of Morse perestroikas (or taking a partial dual) and Vassil…
The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.
problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying k-equivalent curves, analyzing intersections with other curves. result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.
We introduce a method that uses the Cauchy-Crofton formula and a new curvature formula from integral geometry to reweight the sampling probabilities of Metropolis-within-Gibbs algorithms in order to increase their convergence speed. We consider algorithms that sample from a probability density conditioned on a manifold…
The paper finds diffeomorphic complex intersections with distinct Hodge numbers.
problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.
New polynomials defined for virtual knots, calculated up to crossing 4.
problem Defining and calculating invariants for virtual knots.
method Intersection number of curves on a closed surface.
result Intersection polynomials calculated up to crossing 4.
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…
We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…
Conditions for curves on a torus with specific pairwise intersections.
problem Finding curves on a torus with prescribed pairwise intersections.
method Necessary and sufficient conditions for curves on a torus with given pairwise intersections.
result Necessary and sufficient conditions for the existence of curves on a torus with specific pairwise intersections.
Study self-intersections of arcs on a pair of pants, proving natural number spectrum.
problem Understanding self-intersections of arcs on a pair of pants.
method Algorithm to compute self-intersection number, bounds established in terms of word length.
result Spectrum of self-intersection numbers covers all natural numbers.
Virtual knots with same writhe polynomial have equivalent intersection graphs.
problem Equivalence of intersection graphs for virtual knots.
method Proved equivalence through writhe polynomial.
result Intersection graphs of virtual knots with the same writhe polynomial are equivalent.
Study properties of self-similar continua with finite intersection property.
problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.
Estimates intersection pairing in hyperbolic 4-manifolds.
problem Estimating intersection pairing in hyperbolic 4-manifolds.
method Using Thurston norms of homology classes.
result Proved an estimate on intersection pairing.
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the i…
Classifies arcs on a 4-punctured sphere that intersect at most once.
problem Classifying arcs on a 4-punctured sphere with intersection constraints.
method Classification of maximal systems of arcs intersecting at most once.
result Maximal systems of arcs on the 4-punctured sphere identified.
James McClure recently showed that the domain for the intersection pairing of PL chains on a PL manifold M is a subcomplex of C∗(M)⊗C∗(M) that is quasi-isomorphic to C∗(M)⊗C∗(M) and, more generally, that the intersection pairing endows C∗(M) with the structure of a partially-defined commutati…
Novel approach for large genus intersection number asymptotics.
problem Computing intersection numbers in large genus.
method Resurgent analysis of n-point functions with quantum curve.
result Extension of Aggarwal's results and new r-spin and Theta-class intersection numbers. The paper calculates self-intersections on a pair of pants using Bowen and Series' coding.
problem Computing the number of self-intersections of closed geodesics on a pair of pants.
method Used Bowen and Series' coding to compute self-intersections.
result Proved a conjecture and provided bounds for self-intersection numbers.
Generic potential primes have no self-intersections or intersections.
problem Finding non-degenerate periodic orbits without self-intersections.
method Generic convex Hamiltonian approach and Mañé genericity.
result Prime periodic orbits do not intersect or have self-intersections.
Paper proves curves can be smoothed to reduce self-intersection by exactly 1.
problem Prove that the shortest closed geodesic self-intersects exactly k times.
method Carefully smoothing intersection points reduces self-intersection by exactly 1.
result The shortest closed geodesic self-intersects exactly k times for hyperbolic and Riemannian metrics.
The paper extends intersection theory for b-divisors, proving monotonicity and volume inequalities.
problem Intersection theory for b-divisors and monotonicity of intersection products.
method Developed general intersection theory of nef b-divisors, defined restricted volume, proved monotonicity.
result Proved quantitative monotonicity of intersection product and new volume inequalities.
Study intersection polynomials of long virtual knots with supporting genera.
problem Characterize long virtual knots using geometric invariants.
method Define and analyze 1- and 2-supporting genera, and use them to filter long virtual knots. result Provide complete realizability criteria for all twelve intersection polynomials.
New invariant csm simplifies computing geometric invariants of recursive group orbits.
problem Computing geometric invariants of recursive group orbits is hard.
method Introduced new invariant csm and used it to compute invariants explicitly. result Explicit formulas for local Euler obstructions and sectional Euler characteristics.