{'fraction_non_alphanumeric': 0.03954802259887006, 'fraction_numerical': 0.003766478342749529, 'mean_word_length': 4.014150943396227, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares

Abstract We consider the class An(k) of all (0, 1)-matrices Ak of size n × n with exactly k ones in each row and each column, k = 1, ... , n. We prove an asymptotic formula for the permanent per Ak, which holds true as n → ∞ and 0 < n - k = o(n/ln n) uniformly with respect to Ak ∈ An(k). We discuss the known upper and lower bounds for the numbers of m × n Latin rectangles and of n × n Latin squares and asymptotic expressions of these numbers as n → ∞ and m = m(n). We notice that the well-known O'Neil conjecture on the asymptotic behaviour of the number of Latin squares holds in a strong form. We formulate new conjectures of such kind and deduce from these conjectures asymptotic estimates of the numbers of Latin rectangles and Latin squares that sharpen the results known before. In conclusion, we give a short review of the literature devoted to the questions discussed in the paper with formulations of the main results.