Counting extreme <Emphasis Type="Italic">U</Emphasis><Subscript>1</Subscript> matrices and characterizing quadratic doubly stochastic operators

The U ₁ matrix and extreme U ₁ matrix were successfully used to study quadratic doubly stochastic operators by R. Ganikhodzhaev and F. Shahidi [Linear Algebra Appl., 2010, 432: 24–35], where a necessary condition for a U ₁ matrix to be extreme was given. S. Yang and C. Xu [Linear Algebra Appl., 2013, 438: 3905–3912] gave a necessary and sufficient condition for a symmetric nonnegative matrix to be an extreme U ₁ matrix and investigated the structure of extreme U ₁ matrices. In this paper, we count the number of the permutation equivalence classes of the n × n extreme U ₁ matrices and characterize the structure of the quadratic stochastic operators and the quadratic doubly stochastic operators.     

On eigenvalues of random complexes

We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial–Meshulam model X^k(n, p) of random k-dimensional simplicial complexes on n vertices. We show that for p = Ω(logn/n), the eigenvalues of each of the matrices are a.a.s. concentrated around two values. The main tool, which goes back to the work of Garland, are arguments that relate the eigenvalues of these matrices to those of graphs that arise as links of (k - 2)-dimensional faces. Garland’s result concerns the Laplacian; we develop an analogous result for the adjacency matrix.     

A stability result using the matrix norm to bound the permanent

We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose A is an n × n matrix over C (resp. R), and let P denote the set of n × n matrices over C (resp. R) that can be written as a permutation matrix times a unitary diagonal matrix. Then it is known that the permanent of A satisfies |per(A)| ≤ ||A|| ⁿ ₂ with equality iff A/||A||₂ ∈ P (where ||A||₂ is the operator 2-norm of A). We show a stability version of this result asserting that unless A is very close (in a particular sense) to one of these extremal matrices, its permanent is exponentially smaller (as a function of n) than ||A|| ⁿ ₂. In particular, for any fixed α, β > 0, we show that |per(A)| is exponentially smaller than ||A|| ⁿ ₂ unless all but at most αn rows contain entries of modulus at least ||A||₂(1?β).     

Monotonicity of strata in the stratification of the cone of totally positive matrices

According to a theorem of Bjorner [5], there exists a stratified space whose strata are labeled by the elements of [u, v] for every interval [u, v] in the Bruhat order of a Coxeter group W, and each closed stratum (respectively the boundary of each stratum) has the homology of a ball (respectively of a sphere). In [6], Fomin and Shapiro suggest a natural geometric realization of these stratified spaces for a Weyl group W of a semi-simple Lie group G, and then prove its validity in the case of the symmetric group. The stratified spaces arise as links in the Bruhat decomposition of the totally non-negative part of the unipotent radical of G. In this article, we verify the topological regularity property of the strata formed as a result of Bruhat partial ordering on the elements of theWeyl group (of rank 4) of a semi-simple simply connected algebraic group G which is SL(4,?) in our case here. The Weyl group here is the Coxeter group S ₄.     

The degree of biholomorphic mappings between special domains in ℂ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> preserving 0

Let G _i be a closed Lie subgroup of U(n), Ω _i be a bounded G _i -invariant domain in C ⁿ which contains 0, and \(O{\left( {{\mathbb{C}^n}} \right)^{{G_i}}} = \mathbb{C}\), for i = 1; 2. If f: Ω₁ → Ω₂ is a biholomorphism, and f(0) = 0, then f is a polynomial mapping (see Ning et al. (2017)). In this paper, we provide an upper bound for the degree of such polynomial mappings. It is a natural generalization of the well-known Cartan’s theorem.     

A relationship between twisted conjugacy classes and the geometric invariants Ω<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

A group G is said to have the property R _∞ if every automorphism \({\varphi \in {\rm Aut}(G)}\) has an infinite number of φ-twisted conjugacy classes. Recent work of Gonçalves and Kochloukova uses the Σ ⁿ (Bieri–Neumann–Strebel–Renz) invariants to show the R _∞ property for a certain class of groups, including the generalized Thompson’s groups F _n,0. In this paper, we make use of the Ω ⁿ invariants, analogous to Σ ⁿ , to show R _∞ for certain finitely generated groups. In particular, we give an alternate and simpler proof of the R _∞ property for BS(1, n). Moreover, we give examples for which the Ω ⁿ invariants can be used to determine the R _∞ property while the Σ ⁿ invariants techniques cannot.     

Linear information for approximation of the Itô integrals

We study optimal approximation of stochastic integrals in the Itô sense when linear information, consisting of certain integrals of trajectories of Brownian motion, is available. Upper bounds on the nth minimal error, where n is the fixed cardinality of information, are obtained by the Wagner–Platen algorithm and are O(n ^???3/2) or O(n ^???2), depending on considered class of integrands. We also show that Ω(n ^???2) is a lower bound which holds even for very smooth integrands.     

On Some Functional Equations and Representations of Topological Semigroups

Let a representation T of a semigroup G on a linear space X be given. We call x ∈ X a finite vector if its orbit T(G) is contained in a finite-dimensional subspace. In this paper, some statements about finite vectors are applied to the following problem. For a given positive integer n > 1, describe all continuous functions f : G → ? such that the function (x₁,..., x _n ) ? f(x₁ + ? + x _n ) can be polynomially expressed via functions of sums of fewer variables.     

Linear preservers of row-dense matrices

Let M_m,n be the set of all m × n real matrices. A matrix A ∈ M_m,n is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions T: M_m,n → M_m,n that preserve or strongly preserve row-dense matrices, i.e., T(A) is row-dense whenever A is row-dense or T(A) is row-dense if and only if A is row-dense, respectively. Similarly, a matrix A ∈ M_n,m is called a column-dense matrix if every column of A is a column-dense vector. At the end, the structure of linear preservers (strong linear preservers) of column-dense matrices is found.     

On the Classification of <Emphasis Type="Italic">p</Emphasis>-Adic UHF Banach Algebras

For any prime number p let Ω_p be the p-adic counterpart of the complex numbers C. In this paper we investigate the class of p-adic UHF Banach algebras. A p-adic UHF Banach algebra is any unital p-adic Banach algebra A of the form \(A = \overline {U{M_n}} \), where (M_n) is an increasing sequence of p-adic Banach subalgebras of M such that each M_n is generated over Ω_p by an algebraic system of matrix units {e _ij ^{( n)} | 1 ≤ i, j ≤ p_n }. The main result is that the supernatural number associated to a p-adic TUHF Banach algebra is an invariant of the algebra.     

From Grassmann Necklaces to Restricted Permutations and Back Again

We study the commutative algebras Z _{J K} appearing in Brown and Goodearl’s extension of the \(\mathcal {H}\)-stratification framework, and show that if A is the single parameter quantized coordinate ring of M _m,n , G L _n or S L _n , then the algebras Z _{J K} can always be constructed in terms of centres of localizations. The main purpose of the Z _{J K} is to study the structure of the topological space s p e c(A), which remains unknown for all but a few low-dimensional examples. We explicitly construct the required denominator sets using two different techniques (restricted permutations and Grassmann necklaces) and show that we obtain the same sets in both cases. As a corollary, we obtain a simple formula for the Grassmann necklace associated to a cell of totally nonnegative real m × n matrices in terms of its restricted permutation.     

Parabolic equation with a singular potential

We study the existence of a nonnegative generalized solution of an initial-boundary value problem for the heat equation with a singular potential in an arbitrary bounded domain Ω ? R ⁿ , n ≥ 3, containing the unit ball. We show that if the condition ∝ _Ω V ^n/2+s |x| ^s dx ≤ c _n is satisfied for some s ≥ 0 and c _n = c _n (n, s, Ω) > 0, then the problem in question has a nonnegative solution.     

Exponentially Many Monochromatic <Emphasis Type="Italic">n</Emphasis>-Matchings in <Emphasis Type="Italic">K</Emphasis><Subscript>3<Emphasis Type="Italic">n</Emphasis>-1</Subscript>

Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K _3n-1, there is a n-matching containing edges with the same color(we call such matching monochromatic matching). In this paper we show that for any 2-edge-coloring of K _3n-1 there exists a monochromatic subgraph H of K _3n-1 which contains exponentially many monochromatic n-matchings.     

Geometry and inequalities of geometric mean

We study some geometric properties associated with the t-geometric means A ?_tB:= A^1/2(A^?1/2BA^?1/2)^tA^1/2 of two n × n positive definite matrices A and B. Some geodesical convexity results with respect to the Riemannian structure of the n × n positive definite matrices are obtained. Several norm inequalities with geometric mean are obtained. In particular, we generalize a recent result of Audenaert (2015). Numerical counterexamples are given for some inequality questions. A conjecture on the geometric mean inequality regarding m pairs of positive definite matrices is posted.     

The real symmetric matrices of odd order with a P-set of maximum size

Suppose that A is a real symmetric matrix of order n. Denote by m_A(0) the nullity of A. For a nonempty subset α of {1, 2,..., n}, let A(α) be the principal submatrix of A obtained from A by deleting the rows and columns indexed by α. When m_A(α)(0) = m_A(0)+|α|, we call α a P-set of A. It is known that every P-set of A contains at most ?n/2? elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As a first step to the full characterization of these graphs of odd order, we establish some conditions for such graphs G under which there is a real symmetric matrix A whose graph is G and contains a P-set of size (n ? 1)/2.     

On Excess-time Correlated Cumulative Processes

In this paper a class of correlated cumulative processes, B _s (t) = ∑^N(t)_i=1 H _s (X _i )X _i , is studied with excess level increments X _i ?s, where {N(t), t ?0} is the counting process generated by the renewal sequence T _n , T _n and X _n are correlated for given n, H _s (t) is the Heaviside function and s?0 is a given constant. Several useful results, for the distributions of B _s (t), and that of the number of excess (non-excess) increments on (0, t) and the corresponding means, are derived. First passage time problems are also discussed and various asymptotic properties of the processes are obtained. Transform results, by applying a flexible form for the joint distribution of correlated pairs (T _n , X _n ) are derived and inverted. The case of non-excess level increments, X _i < s, is also considered. Finally, applications to known stochastic shock and pro-rata warranty models are given.     

Rectangular <Emphasis Type="Italic">R</Emphasis>-Transform as the Limit of Rectangular Spherical Integrals

In this paper, we connect rectangular free probability theory and spherical integrals. We prove the analogue, for rectangular or square non-Hermitian matrices, of a result that Guionnet and Maïda proved for Hermitian matrices in (J. Funct. Anal. 222(2):435–490, 2005). More specifically, we study the limit, as n and m tend to infinity, of \(\frac{1}{n}\log\mathbb{E}\{\exp[\sqrt{nm}\theta X_{n}]\}\), where θ∈?, X _n is the real part of an entry of U _n M _n V _m and M _n   is a certain n×m deterministic matrix and U _n and V _m are independent Haar-distributed orthogonal or unitary matrices with respective sizes n×n and m×m. We prove that when the singular law of M _n converges to a probability measure μ, for θ small enough, this limit actually exists and can be expressed with the rectangular R-transform of μ. This gives an interpretation of this transform, which linearizes the rectangular free convolution, as the limit of a sequence of log-Laplace transforms.