Related papers: Global Uniqueness and Solvability for Tensor Compl…
Tensor completion is a technique of filling missing elements of the incomplete data tensors. It being actively studied based on the convex optimization scheme such as nuclear-norm minimization. When given data tensors include some noises,…
The conformal thin sandwich (CTS) equations are a set of four of the Einstein equations, which generalize the Laplace-Poisson equation of Newton's theory. We examine numerically solutions of the CTS equations describing perturbed Minkowski…
Recent works on cost based relaxations have improved Constraint Programming (CP) models for the Traveling Salesman Problem (TSP). We provide a short survey over solving asymmetric TSP with CP. Then, we suggest new implied propagators based…
A pattern is called universal in another collection of sets, when every set in the collection contains some linear and translated copy of the original pattern. Paul Erd\H{o}s proposed a conjecture that no infinite set is universal in the…
We obtain sufficient conditions for the uniqueness of solutions to the Cauchy problem for the continuity equation in classes of measures that need not be absolutely continuous.
We exhibit a connection between geometric stability theory and the classification of unstable structures at the level of simplicity and the $\mathrm{NSOP}_{1}$-$\mathrm{SOP}_{3}$ gap. Particularly, we introduce generic expansions $T^{R}$ of…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering…
This thesis contributes to the understanding of symmetry-enriched topological phases focusing on their descriptions in terms of tensor network states. The Projected Entangled Pair State (PEPS) formalism allows us to locally encode the main…
We use computational algorithms recently developed by us to study completely four index divergence free quadratic in Riemann tensor polynomials in GR. Some results are new and some other reproduce and/or correct known ones. The algorithms…
We describe a new class of positive linear discrete-time switching systems for which the problems of stability or stabilizability can be resolved constructively. This class generalizes the class of systems with independently switching state…
Pfister and Sullivan proved that if a topological dynamical system $(X,T)$ satisfies almost product property and uniform separation property, then for each nonempty compact %convex subset $K$ of invariant measures, the entropy of saturated…
In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization problems (COPs) defined on graphs. While the obtained results…
In this article, we introduce the class $B$-Nekrasov tensor in the context of tensor complementarity problem. We study some tensor theoretic properties. We show that the class of B-Nekrasov tensor contains the class of Nekrasov $Z$-tensor…
We study the relation between topological string theory and singularity theory using the partition function of $A_{N-1}$ topological string defined by matrix integral of Kontsevich type. Genus expansion of the free energy is considered, and…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We describe an approach to fix the gauge degrees of freedom in tensor networks, including those with closed loops, which allows a canonical form for arbitrary tensor networks to be realized. Additionally, a measure for the internal…
Utilizing the notion of property (T) we construct new examples of quantum group norms on the polynomial algebra of a compact quantum group, and provide criteria ensuring that these are not equal to neither the minimal nor the maximal norm.…
The notion of a capped tensor product, introduced by G. Gr\"{a}tzer and the author, provides a convenient framework for the study of tensor products of lattices that makes it possible to extend many results from the finite case to the…
A tensor network is a product of tensors associated with vertices of some graph $G$ such that every edge of $G$ represents a summation (contraction) over a matching pair of indexes. It was shown recently by Valiant, Cai, and Choudhary that…