Аннотация:
Доказывается следующее предположение Ван дер Вардена: если
X – дважды стохастическая матрица порядка n, то per(X)⩾n!/nn.
Далее, доказывается: если ограничиться матрицами без нулевых элементов,
то равенство достигается лишь для X=(1/n). Библ. 3 назв.
Образец цитирования:
Д. И. Фаликман, “Доказательство гипотезы Ван дер Вардена о перманенте дважды стохастической
матрицы”, Матем. заметки, 29:6 (1981), 931–938; Math. Notes, 29:6 (1981), 475–479
Alexandr V. Kostochka, Douglas B. West, Zimu Xiang, “Sharp lower bounds for the number of maximum matchings in bipartite multigraphs”, Journal of Graph Theory, 2024
Swee Hong Chan, Igor Pak, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 875
Yuwen Huang, Navin Kashyap, Pascal O. Vontobel, “Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix”, IEEE Trans. Inform. Theory, 70:7 (2024), 5289
Swee Hong Chan, Igor Pak, “Equality cases of the Alexandrov–Fenchel inequality are not in the polynomial hierarchy”, Forum of Mathematics, Pi, 12 (2024)
Yuwen Huang, Pascal O. Vontobel, 2023 IEEE International Symposium on Information Theory (ISIT), 2023, 2774
N. Bebiano, R. Lemos, G. Soares, Trends in Mathematics, Operator and Norm Inequalities and Related Topics, 2022, 3
Raphael Yuster, “Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs”, Journal of Combinatorial Theory, Series B, 153 (2022), 195
Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, Ben Lund, “Perfect matchings and derangements on graphs”, Journal of Graph Theory, 97:2 (2021), 340
Lei Cao, Zhi Chen, Selcuk Koyuncu, Huilan Li, “Permanents of doubly substochastic matrices”, Linear and Multilinear Algebra, 68:3 (2020), 594
Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1184
Valerii N. Berestovskii, Selected Works II, 2018, 89
Bernhard Korte, Jens Vygen, Algorithms and Combinatorics, 21, Combinatorial Optimization, 2018, 245
Matthew Kwan, Benny Sudakov, “Intercalates and discrepancy in random Latin squares”, Random Struct Algorithms, 52:2 (2018), 181
Asaf Ferber, Matthew Kwan, Benny Sudakov, “Counting Hamilton cycles in sparse random directed graphs”, Random Struct Algorithms, 53:4 (2018), 592
Martin Aigner, Günter M. Ziegler, Das BUCH der Beweise, 2018, 193
Asaf Ferber, Gal Kronenberg, Eoin Long, “Packing, counting and covering Hamilton cycles in random directed graphs”, Isr. J. Math., 220:1 (2017), 57
Moshe Schwartz, Pascal O. Vontobel, “Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric”, IEEE Trans. Inform. Theory, 63:10 (2017), 6227
Venkat Chandrasekaran, Parikshit Shah, “Relative entropy optimization and its applications”, Math. Program., 161:1-2 (2017), 1
Benny Sudakov, Surveys in Combinatorics 2017, 2017, 372
А. А. Тараненко, “Перманенты многомерных матриц: свойства и приложения”, Дискретн. анализ и исслед. опер., 23:4 (2016), 35–101; A. A. Taranenko, “Permanents of multidimensional matrices: properties and applications”, J. Appl. Industr. Math., 10:4 (2016), 567–604
Цитирование в формате AMSBIB
Обратная связь: