On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries

We consider the set Σ(R,C) of all m×n matrices having 0-1 entries and prescribed row sums R=(r₁,…,rm) and column sums C=(c₁,…,cn). We prove an asymptotic estimate for the cardinality |Σ(R,C)| via the solution to a convex optimization problem. We show that if Σ(R,C) is sufficiently large, then a random matrix D∈Σ(R,C) sampled from the uniform probability measure in Σ(R,C) with high probability is close to a particular matrix Z=Z(R,C) that maximizes the sum of entropies of entries among all matrices with row sums R, column sums C and entries between 0 and 1. Similar results are obtained for 0-1 matrices with prescribed row and column sums and assigned zeros in some positions.     

Generalized doubly stochastic and permutation matrices over a ring

Let R be a ring with unity. A combinatorial argument is used to show that the R-module Δ_n(R) of all n × n matrices over R with constant row and column sums has a basis consisting of permutation matrices. This is used to characterize orthogonal matrices which are linear combinations of permutation matrices. It is shown that all bases of Δ_n(R) consisting of permutation matrices have the same cardinality, and other properties of bases of Δ_n(R) are investigated.     

A note on k-potence preserving maps

Let M_n be the algebra of all n×n complex matrices and Γ_n the set of all k-potent matrices in M_n. Suppose ?:M_n→M_n is a map satisfying A-λB∈Γ_n implies ?(A)-λ?(B)∈Γ_n, where A, B∈M_n, λ∈C. Then either ? is of the form ?(A)=cTAT^-1, A∈M_n, or ? is of the form ?(A)=cTA^tT^-1, A∈M_n, where T∈M_n is an invertible matrix, c∈C satisfies c^k=c.     

Non-spectral problem for a class of planar self-affine measures

The self-affine measure μM,D corresponding to an expanding matrix M∈Mn(R) and a finite subset D⊂Rn is supported on the attractor (or invariant set) of the iterated function system {?d(x)=M⁻¹(x+d)}_d∈D. The spectral and non-spectral problems on μM,D, including the spectrum-tiling problem implied in them, have received much attention in recent years. One of the non-spectral problem on μM,D is to estimate the number of orthogonal exponentials in L²(μM,D) and to find them. In the present paper we show that if a,b,c∈Z, |a|>1, |c|>1 and ac∈Z?(3Z),

     

Quantum Dynamical coBoundary Equation for finite dimensional simple Lie algebras

For a finite dimensional simple Lie algebra g, the standard universal solution R(x)∈Uq(g)^⊗2 of the Quantum Dynamical Yang-Baxter Equation quantizes the standard trigonometric solution of the Classical Dynamical Yang-Baxter Equation. It can be built from the standard R-matrix and from the solution F(x)∈Uq(g)^⊗2 of the Quantum Dynamical coCycle Equation as . F(x) can be computed explicitly as an infinite product through the use of an auxiliary linear equation, the ABRR equation.Inspired by explicit results in the fundamental representation, it has been conjectured that, in the case where g=sl(n+1)(n?1) only, there could exist an element M(x)∈Uq(sl(n+1)) such that the dynamical gauge transform RJ of R(x) by M(x),

RJ=M₁⁻¹(x)M₂(xqh₁⁾⁻¹R(x)M₁(xqh₂)M₂(x),     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

Duality for a Class of Multiobjective Control Problems

In this paper, a class of multiobjective control problems is considered, where the objective and constraint functions involved are f(t, x(t), ?(t), y(t), z(t)) with x(t) ∈ Rⁿ, y(t) ∈ Rⁿ, and z(t) ∈ R^m, where x(t) and z(t) are the control variables and y(t) is the state variable. Under the assumption of invexity and its generalization, duality theorems are proved through a parametric approach to related properly efficient solutions of the primal and dual problems.     

An extension of Birkhoff’s theorem with an application to determinants

Let M_n(F) denote the algebra of n×n matrices over the field F of complex, or real, numbers. Given a self-adjoint involution J∈M_n(C), that is, J=J^*,J²=I, let us consider Cⁿ endowed with the indefinite inner product [,] induced by J and defined by [x,y]?〈Jx,y〉,x,y∈Cⁿ. Assuming that (r,n-r), 0?r?n, is the inertia of J, without loss of generality we may assume J=diag(j₁,?,j_n)=I_r⊕-I_n-r. For T=(|t_ik|²)∈M_n(R), the matrices of the form T=(|t_ik|²j_ij_k), with all line sums equal to 1, are called J-doubly stochastic matrices. In the particular case r∈{0,n}, these matrices reduce to doubly stochastic matrices, that is, non-negative real matrices with all line sums equal to 1. A generalization of Birkhoff’s theorem on doubly stochastic matrices is obtained for J-doubly stochastic matrices and an application to determinants is presented.     

Procrustes problems and associated approximation problems for matrices with k-involutory symmetries

We say that a matrix R∈C^n×n is k-involutary if its minimal polynomial is x^k-1 for some k?2, so R^k-1=R^-1 and the eigenvalues of R are 1,ζ,ζ²,…,ζ^k-1, where ζ=e^2πi/k. Let α,μ∈{0,1,…,k-1}. If R∈C^m×m, A∈C^m×n, S∈C^n×n and R and S are k-involutory, we say that A is (R,S,μ)-symmetric if RAS^-1=ζ^μA, and A is (R,S,α,μ)-symmetric if RAS^-α=ζ^μA.Let L be the class of m×n(R,S,μ)-symmetric matrices or the class of m×n(R,S,α,μ)-symmetric matrices. Given X∈C^n×t and B∈C^m×t, we characterize the matrices A in L that minimize ‖AX-B‖ (Frobenius norm), and, given an arbitrary W∈C^m×n, we find the unique matrix A∈L that minimizes both ‖AX-B‖ and ‖A-W‖. We also obtain necessary and sufficient conditions for existence of A∈L such that AX=B, and, assuming that the conditions are satisfied, characterize the set of all such A.     

A Sard theorem for tame set-valued mappings

If F is a set-valued mapping from Rn into Rm with closed graph, then y∈Rm is a critical value of F if for some x with y∈F(x), F is not metrically regular at (x,y). We prove that the set of critical values of a set-valued mapping whose graph is a definable (tame) set in an o-minimal structure containing additions and multiplications is a set of dimension not greater than m−1 (respectively a σ-porous set). As a corollary of this result we get that the collection of asymptotically critical values of a set-valued mapping with a semialgebraic graph has dimension not greater than m−1. We also give an independent proof of the fact that a definable continuous real-valued function is constant on components of the set of its subdifferentiably critical points.     

Ruzsa’s constant on additive functions

A function f : N → R is called additive if f(mn)= f(m)+f(n)for all m, n with(m, n)= 1. Let μ(x)= max n≤x(f(n)f(n + 1))and ν(x)= max n≤x(f(n + 1)f(n)). In 1979, Ruzsa proved that there exists a constant c such that for any additive function f , μ(x)≤ cν(x 2 )+ c f , where c f is a constant depending only on f . Denote by R af the least such constant c. We call R af Ruzsa's constant on additive functions. In this paper, we prove that R af ≤ 20.     

Semidefinite descriptions of low-dimensional separable matrix cones

Let K⊂E, K^′⊂E^′ be convex cones residing in finite-dimensional real vector spaces. An element y in the tensor product E⊗E^′ is K⊗K^′-separable if it can be represented as finite sum , where x_l∈K and for all l. Let S(n), H(n), Q(n) be the spaces of n×n real symmetric, complex Hermitian and quaternionic Hermitian matrices, respectively. Let further S₊(n), H₊(n), Q₊(n) be the cones of positive semidefinite matrices in these spaces. If a matrix A∈H(mn)=H(m)⊗H(n) is H₊(m)⊗H₊(n)-separable, then it fulfills also the so-called PPT condition, i.e. it is positive semidefinite and has a positive semidefinite partial transpose. The same implication holds for matrices in the spaces S(m)⊗S(n), H(m)⊗S(n), and for m?2 in the space Q(m)⊗S(n). We provide a complete enumeration of all pairs (n,m) when the inverse implication is also true for each of the above spaces, i.e. the PPT condition is sufficient for separability. We also show that a matrix in Q(n)⊗S(2) is Q₊(n)⊗S₊(2)- separable if and only if it is positive semidefinite.     

On the integrality of nth roots of generating functions

Motivated by the discovery that the eighth root of the theta series of the E₈ lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f∈R (where R=1+xZ?x?) can be written as f=gn for g∈R, n?2. Let Pn:={gn|g∈R} and let . We show among other things that (i) for f∈R, f∈Pn⇔f (mod μn)∈Pn, and (ii) if f∈Pn, there is a unique g∈Pn with coefficients mod μn/n such that f≡gn (mod μn). In particular, if f≡1 (mod μn) then f∈Pn. The latter assertion implies that the theta series of any extremal even unimodular lattice in Rn (e.g. E₈ in R⁸) is in Pn if n is of the form i²j³k⁵ (i?3). There do not seem to be any exact analogues for codes, although we show that the weight enumerator of the rth order Reed-Muller code of length m² is in Pr² (and similarly that the theta series of the Barnes-Wall lattice BWm² is in Pm²). We give a number of other results and conjectures, and establish a conjecture of Paul D. Hanna that there is a unique element f∈Pn (n?2) with coefficients restricted to the set {1,2,…,n}.     

Gevrey micro-regularity for solutions to first order nonlinear PDE

Let (x,t)∈Rm×R and u∈C²(Rm×R). We study the Gevrey micro-regularity of solutions u of the nonlinear equation

ut=f(x,t,u,ux),     

Endpoint estimates for the commutator of pseudo-differential operators

It is well known that the commutator Tb of the Calderón-Zygmund singular integral operator is bounded on L^p(Rⁿ) for 1 < p < +∞ if and only if b ∈ BMO [1]. On the other hand, the commutator T_b is bounded from H¹(Rⁿ) into L¹(Rⁿ) only if the function b is a constant [2]. In this article, we will discuss the boundedness of commutator of certain pseudo-differential operators on Hardy spaces H¹. Let T^σ be the operators that its symbol is S⁰_1,δ with 0 ≤ δ < 1, if b ∈ LMO_∞, then, the commutator [b, T^σ] is bounded from H¹(Rⁿ) into L¹(Rⁿ) and from L¹(Rⁿ) into BMO(Rⁿ); If [b, T^σ] is bounded from H¹(Rⁿ) into L¹(Rⁿ) or L¹(Rⁿ) into BMO(Rⁿ), then, b ∈ LMO_loc.     

Integrability of a SIS model

We prove that the classical model of an infectious disseise, which never kills and which does not induce autoimmunity, is integrable. This model can be written as x^′=−bxy−mx+cy+mk, y^′=bxy−(m+c)y with parameters b,c,k,m∈R. We provide the explicit expression of its first integrals and of the set of all its invariant algebraic curves.     

Convex integer maximization via Graver bases

We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R^d and w₁x,…,w_dx are linear forms on Rⁿ,

max{c(w₁x,…,w_dx):Ax=b,x∈Nⁿ}.     

Square-zero derivations of matrix algebras over commutative rings

Let R be a commutative ring with identity, M _n (R) the R-algebra consisting of all n by n matrices over R. In this article, for n ≥ 5 we classify linear maps φ from M _n (R) into itself satisfying φ(x)x + xφ(x) = 0 whenever x ² = 0. We call such maps as square-zero derivations.     

k-Potence preserving maps without the linearity and surjectivity assumptions

Let M_n be the space of all n × n complex matrices, and let Γ_n be the subset of M_n consisting of all n × n k-potent matrices. We denote by Ψ_n the set of all maps on M_n satisfying A − λB ∈ Γ_n if and only if ?(A) − λ?(B) ∈ Γ_n for every A,B ∈ M_n and λ ∈ C. It was shown that ? ∈ Ψ_n if and only if there exist an invertible matrix P ∈ M_n and c ∈ C with c^k−1 = 1 such that either ?(A) = cPAP⁻¹ for every A ∈ M_n, or ?(A) = cPA^TP⁻¹ for every A ∈ M_n.     

On certain functional equation related to two-sided centralizers

Let m ≥ 0, n ≥ 0 be fixed integers with m + n ≠ 0 and let R be a prime ring with char(R) = 0 or m + n + 1 ≤ char(R) ≠ 2. Suppose that there exists an additive mapping T : R → R satisfying the relation 2T(x ^m+n+1) = x ^m T(x) x ⁿ  + x ⁿ T(x)x ^m for all ${x\in R}$ . In this case T is a two-sided centralizer.