?
Detecting matrices of combinatorial rank three
Journal of Combinatorial Theory, Series A. 2014. Vol. 126. P. 166–176.
Shitov Y.
The smallest integer k for which the elements of a real matrix A can be expressed as A_ij = min B_it + C_tj with B an m-by-k matrix and C an k-by-n matrix is called the combinatorial rank of A. This notion was introduced by Barvinok in 1993, and he posed a problem on the complexity of detecting matrices with combinatorial rank equal to a fixed integer k. Fast algorithms solving this problem have been known only for k=2, and we construct an algorithm that decides whether or not a given matrix has combinatorial rank three in time O((m + n)^3 mn log(mn)).
Keywords: алгоритмmatrix factorizationsalgorithmtropical semiringтропическое полукольцофакторизация матриц
Publication based on the results of:
Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.
In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...
Added: July 21, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 2026
Zlotnik Alexander, / Series arXiv "math". 2026. No. 2602.03481v1.
We deal with the global in time weak solutions to the 1D compressible Navier-Stokes system of equations for large discontinuous initial data and nonhomogeneous boundary conditions of three standard types. We prove the Lipschitz-type continuous dependence of the solution $(\eta,u,\theta)$, in a norm slightly stronger than $L^{2,\infty}(Q)\times L^2(Q)\times L^2(Q)$, on the initial data $(\eta^0,u^0,e^0)$ in a ...
Added: April 18, 2026
Medvedev V., / Series arXiv "math". 2026.
We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a ...
Added: April 3, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Chebotareva E., Mukhamedshin A., Imamov N. et al., , in: 2025 11th International Conference on Automation, Robotics, and Applications (ICARA), 12-14 Feb. 2025.: IEEE, 2025. Ch. 2025 P. 252–256.
Added: March 17, 2026
Vaschenko A., Frolov O., Safin R. et al., , in: 16th International Conference on Intelligent Systems, INTELS 2024, Moscow, Russia, December 2–4, 2024, Proceedings, Part I. Intelligent Systems. (CCIS, volume 2603).: Springer, 2025. P. 311–324.
Swarm robotics is a complex domain within multi-robot systems that encompasses formation control, movement control, and interUAV communication. Coordinates task execution requires effctive swarm control, which relies on robust motion control algorithms and reliable data exchange mechanisms. In this work, we propose an operator-leaderfollowers approach for managing UAV swarms. It comprises the following components: centralized swarm control utilizing ...
Added: March 17, 2026
Альбатша А. М., Международный журнал гуманитарных и естественных наук 2025 Т. 3-1 С. 195–199
Параллельные программы стали приобретать все большую важность и значимость в последние годы из-за стремительного роста информационных массивов и как следствие необходимости быстрой обработки больших объемов данных. В тоже время, традиционные методы компиляции, разработанные для последовательных программ, не гарантируют правильность (последовательную согласованность) преобразований компилятора при применении к параллельным программам. В связи с этим, статья посвящена анализу ...
Added: March 10, 2026
Урюпин И. В., Sukharev A., Vlasenko A., Информационные технологии и вычислительные системы 2023 № 3 С. 79–92
Transportation systems including air transportation play one of the most important roles in the economic and social development of any country. The effectiveness of the quality of control of such complex systems can be assessed according to various criteria, from the cost of developing infrastructure to the degree of satisfaction of the population with transport. ...
Added: February 24, 2026
Kolesnikov A., / Series arXiv "math". 2025.
We study Blaschke--Santal{ó}-type inequalities for N>=2 sets (functions) and a special class of cost functions. In particular, we prove new results about reduction of the maximization problem for the Blaschke--Santal{ó}-type functional to homogeneous case (functional inequalities on the sphere) and extend the symmetrization argument to the case of N>2 sets.
We also discuss links to the ...
Added: February 13, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Gaianov N., Parusnikova A., / Cornell University. Серия math "arxiv.org". 2025.
An algebraic q-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this sufficient condition for constructing a formal expansion of a solution to a certain q-difference analogue of the fifth Painlevé equation ...
Added: December 25, 2025
Матвеев А. Г., Martyanova Е., BRICS Law Journal 2022 P. 144–173
Ubiquitous computerization and digitalization are contributing to the unprecedented growth of the software market. Computer programs are protected as subject of copyright law in international law and domestic legal systems. However, copyright law does not protect the interests of the copyright holder from borrowing ideas and algorithms which often have agreat commercial value. This circumstance ...
Added: December 24, 2025
Popov V., / Series arXiv "math". 2025. No. 2502.01539.
We prove that the variety of flexes of algebraic curves
of degree 3 in the projective plane is an ideal theoretic complete
intersection in the product of a two-dimensional and a nine-dimensional projective spaces. ...
Added: December 16, 2025
Gnetov F., Konakov V., / Series arXiv "math". 2025. No. 2512.04667.
We establish a central limit theorem, a local limit theorem, and a law of large numbers for a natural
random walk on a symmetric space M of non-compact type and rank one. This class of spaces, which
includes the complex and quaternionic hyperbolic spaces and the Cayley hyperbolic plane, generalizes
the real hyperbolic space Hn. Our approach introduces ...
Added: December 5, 2025
Kazakov A., Koryakin V., Safonov K. et al., / Series arXiv "math". 2025.
The Lorenz attractor is the first example of a robustly chaotic non-hyperbolic attractor. Each orbit of such an attractor has a positive top Lyapunov exponent, and this property persists under small perturbations despite possible bifurcations of the attractor. In this paper, we study the boundary of the Lorenz attractor existence region in the Shimizu-Morioka model. ...
Added: December 4, 2025
Roslavtsev M., Eryomin A., Safin R. et al., , in: 2024 8th International Conference on Information, Control, and Communication Technologies (ICCT).: IEEE, 2024. P. 1–5.
Modern map-dependent algorithms for mobile robot navigation typically overload a CPU and memory with a gradually increasing amount of environmental data. In contrast, Bug family local path planning algorithms operate without mapping and have significantly lower hardware requirements. Bug algorithms use real-time measurements from visual and touch sensors to make immediate decisions on direction of ...
Added: November 25, 2025
ROS-based navigation in unknown environment using the InsertBug algorithm: Issues of practical usage
Nekerov I., Safin R., Tsoy T. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2025 Vol. 167 No. 1 P. 38–53
BUG algorithms are effective strategies for local path planning in unknown environments. This article presents a practical implementation of the InsertBug algorithm using the Robot Operating System (ROS) and highlights its challenges. The algorithm relies on laser sensor and odometry data to construct a locally optimal path in an unknown terrain. Its evaluation was performed ...
Added: November 25, 2025