Abstract
The aim of this paper is to present newupper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the bounds improve those from earlier work. Our proofs are based on some new identities for the above-mentioned difference and also for related expressions for matrices over a rational associative commutative unital algebra. Some of our identities are generalizations of results in [J. Dougall, Quantitative proofs of certain algebraic inequalities, Proc. Edinb. Math. Soc., 24:61–77, 1905]. Second-order results are also included.
Similar content being viewed by others
References
A. Barvinok,Computing the permanent of (some) complex matrices, Found. Comput. Math., 16(2):329–342, 2016, https://doi.org/10.1007/s10208-014-9243-7.
E. Bax and J. Franklin, A permanent formula with many zero-valued terms, Inf. Process. Lett., 63(1):33–39, 1997, https://doi.org/10.1016/S0020-0190(97)00078-1.
R. Bhatia, Variation of symmetric tensor powers and permanents, Linear Algebra Appl., 62:269–276, 1984, https://doi.org/10.1016/0024-3795(84)90102-2.
R. Bhatia and L. Elsner, On the variation of permanents, Linear Multilinear Algebra, 27(2):105–109, 1990, https://doi.org/10.1080/03081089008817999.
A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, Evaluation of permanents in rings and semirings, Inf. Process. Lett., 110(20):867–870, 2010, https://doi.org/10.1016/j.ipl.2010.07.005.
S.G. Bobkov, Generalized symmetric polynomials and an approximate de Finetti representation, J. Theor. Probab., 18(2):399–412, 2005, https://doi.org/10.1007/s10959-005-3509-6.
P. Brändén, J. Haglund, M. Visontai, and D.G. Wagner, Proof of the monotone column permanent conjecture, in P. Brändén, M. Passare, and M. Putinar (Eds.), Notions of Positivity and the Geometry of Polynomials, Trends in Math., Springer, Basel, 2011, pp. 63–78, https://doi.org/10.1007/978-3-0348-0142-3_5.
L.M. Brègman, Certain properties of nonnegative matrices and their permanents, Dokl. Akad. Nauk SSSR, 211:27–30, 1973 (in Russian). English transl.: Sov. Math., Dokl., 14:945–949, 1973.
E. Carlen, E.H. Lieb, and M. Loss, An inequality of Hadamard type for permanents, Methods Appl. Anal., 13(1): 1–18, 2006, https://doi.org/10.4310/MAA.2006.v13.n1.a1.
F. Cobos, T. Kühn, and J. Peetre, Multilinear forms of Hilbert type and some other distinguished forms, Integral Equations Oper. Theory, 56(1):57–70, 2006, https://doi.org/10.1007/s00020-005-1412-2.
A. Dinghas, Some identities between arithmetic means and the other elementary symmetric functions of n numbers, Math. Ann., 120(1):154–157, 1948, https://doi.org/10.1007/BF01447828.
J. Dougall, Quantitative proofs of certain algebraic inequalities, Proc. Edinb. Math. Soc., 24:61–77, 1905, https://doi.org/10.1017/S0013091500033393.
L. Elsner, A note on the variation of permanents, Linear Algebra Appl., 109:37–39, 1988, https://doi.org/10.1016/0024-3795(88)90196-6.
S. Friedland, A remark on the variation of permanents, Linear Multilinear Algebra, 27(2):101–103, 1990, https://doi.org/10.1080/03081089008817998.
D.G. Glynn, The permanent of a square matrix, Eur. J. Comb., 31(7):1887–1891, 2010, https://doi.org/10.1016/j.ejc.2010.01.010.
G.H. Hardy, J.E. Littlewood, and G. Pólya, Inequalities, 2nd ed., Cambridge Univ. Press, Cambridge, 1952.
A. Hurwitz, Ueber den Vergleich des arithmetischen und des geometrischen Mittels, J. Reine Angew. Math., 108: 266–268, 1891, https://doi.org/10.1515/crll.1891.108.266.
M. Jerrum, A. Sinclair, and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, J. ACM, 51(4):671–697, 2004, https://doi.org/10.1145/1008731.1008738.
H. Minc, Upper bounds for permanents of (0, 1)-matrices, Bull. Am. Math. Soc., 69:789–791, 1963, https://doi.org/10.1090/S0002-9904-1963-11031-9.
H. Minc, Permanents, Addison-Wesley, Reading, MA, 1978.
Y. Nesterov and A. Nemirovskii, Interior-point polynomial algorithms in convex programming, SIAM, Philadelphia, 1994, https://doi.org/10.1137/1.9781611970791.
B. Roos, On Bobkov’s approximate de Finetti representation via approximation of permanents of complex rectangularmatrices, Proc. Am. Math. Soc., 143(4):1785–1796, 2015, https://doi.org/10.1090/S0002-9939-2014-12429-4.
H.J. Ryser, CombinatorialMathematics, The Mathematical Association of America; distributed by JohnWiley, New York, 1963.
M. Schwartz, Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices, Linear Algebra Appl., 430(4):1364–1374, 2009, https://doi.org/10.1016/j.laa.2008.10.029.
J. Touchard, Sur un problème de permutations, C. R. Acad. Sci. Paris, 198:631–633, 1934 (in French).
L.G. Valiant, The complexity of computing the permanent, Theor. Comput. Sci., 8(2):189–201, 1979, https://doi.org/10.1016/0304-3975(79)90044-6.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Roos, B. New permanent approximation inequalities via identities. Lith Math J 60, 248–275 (2020). https://doi.org/10.1007/s10986-020-09475-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10986-020-09475-9
Keywords
- approximation of normalized permanents
- elementary symmetric polynomials
- expansions for permanents
- permanental inequalities