arXiv research

The paper defines and explores Coxeter type LOTs for ribbon 2-knots.

The paper describes the structure of injective LOT-complexes and proves they are aspherical.

Investigates local indicability of groups with circle homology presentations.

The paper shows how reducible complexes affect local indicability.

Study on weakly G-slim complexes and non-positive immersions for group presentations.

Differential invariants of a (pseudo)group action can vary when restricted to invariant submanifolds (differential equations). The algebra is still governed by the Lie-Tresse theorem, but may change a lot. We describe in details the case of the motion group $O(n)\ltimes\R^n$ acting on the full (unconstraint) jet-space …

The special linear groups, the mapping class groups of surfaces, the outer autormorphism groups of free groups appear in numerous domains. Their analogies, developped in particular in K. Vogtmann's work, have been written about a lot. In this report, we concentrate on the contractible spaces on which these groups act i…

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a contractible 2-dimensional cell complex) is "hard to embed in $\mathbb{R}^3$", in the …

New method detects sliceness of knots in a torus.

We compute the automorphism group of OT manifolds of simple type. We show that the graded pieces under a natural filtration are related to a certain ray class group of the underlying number field. This does not solve the open question whether the geometry of the OT manifold sees the class number directly, but brings us…

Let $U$ be an arbitrary word in letters $x_1^{\pm 1}, ..., x_m^{\pm 1}$ and $m \ge 2$. We prove that the group presentation $<x_1, ..., x_m \|\ U x_i U^{-1} = x_{i+1}, i=1,..., m-1>$ is aspherical. The proof is based upon prior partial results of A. Klyachko and the author on the asphericity of such presentations.

Lecture notes on Lie groups and Chern-Simons theory for grad students.

We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to generalize results of J. Howie and S.M. Gersten on asphericity of LOTs and of Adian pre…

A classical result of H. S. M. Coxeter asserts that a certain quotient $B(m,n)$ of the braid group $B(m)$ on $m$ strands is finite if and only if $(m,n)$ corresponds to the type of one of the five Platonic solids. If ${\bf k}$ is a knot or virtual knot, one can study similar quotients $G({\bf k}, n)$ for the correspond…

Globally irreducible nodes (i.e. nodes whose branches belong to the same irreducible component) have mild effects on the most common topological invariants of an algebraic curve. In other words, adding a globally irreducible node (simple nodal degeneration) to a curve should not change them a lot. In this paper we stud…

LOT framework embeds high-dimensional cell data into interpretable Euclidean space.

Starting from the results in math.DG:1212.3161 we prove that for a given Bianchi group, certain natural coefficent modules and a lot of sequences of congruence subgroups of the size of the torsion subgroup of the first homology grows exponentially with the index (we give an explicit rate). We also prove limit multiplic…

Certain subgroups of the groups $Aut(F_n)$ of automorphisms of a free group $F_n$ are considered. Comparing Alexander polynomials of two poly-free groups $Cb_4^+$ and $P_4$ we prove that these groups are not isomorphic, despite the fact that they have a lot of common properties. This answers the question of Cohen-Pakia…

LOT improves adversarial robustness by training 1-Lipschitz convolution layers.

LOT embeds distributions for linear separability and classification.

LOT framework speeds up event distance computation in collider physics.

The ability to predict city-wide parking availability is crucial for the successful development of Parking Guidance and Information (PGI) systems. Indeed, the effective prediction of city-wide parking availability can improve parking efficiency, help urban planning, and ultimately alleviate city congestion. However, it…

We study deformations of symplectic structures on a smooth manifold $M$ via the quasi-Poisson theory. By a fact, we can deform a given symplectic structure $ω$ to a new symplectic structure $ω_t$ parametrized by some element $t$ in $Λ^2\mathfrak{g}$, where $\mathfrak{g}$ is the Lie algebra of a Lie group $G$. Moreover,…

The Wong-Rosay theorem characterizes the strongly pseudoconvex domains of $\mathbb{C}^n$ by their automorphism groups. It has a lot of generalizations to other kinds of domains (for example, the weakly pseudoconvex domains). However, most of them are for domains of $\mathbb{C}^n$. In this note, we generalize the Wong-R…

LOT Wassmap speeds up Wasserstein space manifold learning.

An elementary proof shows that quasi-isometric groups to integers are virtually integers.

4-manifolds show every flat 3-manifold as cusp sections.

An impossibility result shows limitations in learning symmetries and equivariant functions.

LOT improves optimal transport for large datasets.

We consider a class of learning problems that involve a structured sparsity-inducing norm defined as the sum of $\ell_\infty$-norms over groups of variables. Whereas a lot of effort has been put in developing fast optimization methods when the groups are disjoint or embedded in a specific hierarchical structure, we add…

Computational intelligence in finance has been a very popular topic for both academia and financial industry in the last few decades. Numerous studies have been published resulting in various models. Meanwhile, within the Machine Learning (ML) field, Deep Learning (DL) started getting a lot of attention recently, mostl…

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached successively from $S$ only using edges with labels in $S$ or already visited vert…

Paper withdrawn - lemma 4.1 was false. Quite a lot of changes need to be made!

The problem of low-rank matrix estimation recently received a lot of attention due to challenging applications. A lot of work has been done on rank-penalized methods and convex relaxation, both on the theoretical and applied sides. However, only a few papers considered Bayesian estimation. In this paper, we review the …

Let $Σ_{g,b}$ denote a closed oriented surface genus $g$ with $b$ punctures and let $Mod_{g,b}$ denote its mapping class group. Luo proved that if the genus is at least 3, the group $Mod_{g,b}$ is generated by involutions. He also asked if there exists a universal upper bound, independent of genus and the number of pun…

Nonconvex optimization problems arise in different research fields and arouse lots of attention in signal processing, statistics and machine learning. In this work, we explore the accelerated proximal gradient method and some of its variants which have been shown to converge under nonconvex context recently. We show th…

This paper is devoted to a systematic study of the geometry of nondegenerate $\bbR^n$-actions on $n$-manifolds. The motivations for this study come from both dynamics, where these actions form a special class of integrable dynamical systems and the understanding of their nature is important for the study of other Hamil…

A new method uses model gradients to improve fairness without relying on demographic data.

Graph neural networks denote a group of neural network models introduced for the representation learning tasks on graph data specifically. Graph neural networks have been demonstrated to be effective for capturing network structure information, and the learned representations can achieve the state-of-the-art performanc…

We compute the mod $p$ homology growth of residual sequences of finite index normal subgroups of right-angled Artin groups. We find examples where this differs from the rational homology growth, which implies the homology of subgroups in the sequence has lots of torsion. More precisely, the homology torsion grows expon…

With the usual definition of a super Hilbert space and a super unitary representation, it is easy to show that there are lots of super Lie groups for which the left-regular representation is not super unitary. I will argue that weakening the definition of a super Hilbert space (by allowing the super scalar product to b…

The paper uses causal machine learning to optimize rework decisions in manufacturing.

pyLOT library simplifies machine learning on 3D point clouds via linearized optimal transport.

New triangulations of quaternionic projective plane found with various symmetry groups.

Variable selection for models including interactions between explanatory variables often needs to obey certain hierarchical constraints. The weak or strong structural hierarchy requires that the existence of an interaction term implies at least one or both associated main effects to be present in the model. Lately, thi…

In many learning tasks, structural models usually lead to better interpretability and higher generalization performance. In recent years, however, the simple structural models such as lasso are frequently proved to be insufficient. Accordingly, there has been a lot of work on "superposition-structured" models where mul…

This paper addresses image classification through learning a compact and discriminative dictionary efficiently. Given a structured dictionary with each atom (columns in the dictionary matrix) related to some label, we propose cross-label suppression constraint to enlarge the difference among representations for differe…

New methods reveal rare epimorphisms linking 3-manifold groups to free groups.