Related papers: On the Symmetric Tensors Completion Problem
Motivated by work of the first author, this paper studies symplectic embedding problems of lagrangian products that are sufficiently symmetric. In general, lagrangian products arise naturally in the study of billiards. The main result of…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
In this paper we consider the problems of testing isomorphism of tensors, $p$-groups, cubic forms, algebras, and more, which arise from a variety of areas, including machine learning, group theory, and cryptography. These problems can all…
An exact solution has an axial symmetry is obtained in the teleparallel theory of gravitation. The associated metric has the structure function G(xi)=1-xi^2-2mA(xi)^3. The cubic nature of the structure function can make calculations…
These are notes from the lectures I gave at the Oberwolfach seminar `Tensor Triangular Geometry and Interactions' which was held in October 2025. The aim of these notes is to give an introduction to tensor triangular geometry, for both…
This is survey about the classical knot concordance group, prepared for an upcoming handbook of knot theory. Topics include: the basic definitions of concordance; the theory of algebraic concordance as developed by Levine; the theory of…
We consider the standard gauge theory of Poincar\'{e} group, realizing as a subgroup of $GL(5. R)$. The main problem of this theory was appearing of the fields connected with non-Lorentz symmetries, whose physical sense was unclear. In this…
One way to study an hypergraph is to attach to it a tensor. Tensors are a generalization of matrices, and they are an efficient way to encode information in a compact form. In this paper we study how properties of weighted hypergraphs are…
We propose a tensor product structure that is compatible with the hypergraph structure. We define the algebraic connectivity of the $(m+1)$-uniform hypergraph in this product, and prove the relationship with the vertex connectivity. We…
Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex…
A renormalizable rigid supersymmetry for the four dimensional antisymmetric tensor field model in a curved space-time background is constructed. A closed algebra between the BRS and the supersymmetry operators is only realizable if the…
These are notes of a series of lectures on mirror symmetry and topological string theory given at the Mathematical Sciences Center at Tsinghua University. The N=2 superconformal algebra, its deformations and its chiral ring are reviewed. A…
We study the rigidity results for self-shrinkers in Euclidean space by restriction of the image under the Gauss map. The geometric properties of the target manifolds carry into effect. In the self-shrinking hypersurface situation Theorem…
The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of…
We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.
The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…
The matching complex of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. In the last few years the matching complexes of grid graphs have gained much attention among the topological combinatorists. In 2017, Braun…
We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows…