Let $m$ and $n$ be positive integers, and let $R=(r_1,...,r_m)$ and $S=(s_1,...,s_n)$ be nonnegative integral vectors. Let $A(R,S)$ be the set of all $m\times n$ $(0,1)$-matrices with row sum vector $R$ and column vector $S$. Let $R$ and $S$ be nonincreasing, and let $F\left(R\right)$ be the $m\times n$ $(0,1)$-matrix, where for each $i$, the $i$th row of $F(R,S)$ consists of $r_i$ 1’s followed by $(n-r_i)$ 0’s. Let $A\in A(R,S)$. The discrepancy of A, $\mathrm{disc}\left(A\right)$, is the number of positions in which $F\left(R\right)$ has a 1 and $A$ has a 0. In this paper we investigate linear operators mapping $m\times n$ matrices over...

Let $A$, $B$ be $n\times m$ matrices. The concept of matrix majorization means the $j$th column of $A$ is majorized by the $j$th column of $B$ and this is done for all $j$ by a doubly stochastic matrix $D$. We define rc-majorization that extended matrix majorization to columns and rows of matrices. Also, the linear preservers of rc-majorization will be characterized.

An $m\times n$ matrix $R$ with nonnegative entries is called row stochastic if the sum of entries on every row of $R$ is 1. Let ${𝐌}_{m,n}$ be the set of all $m\times n$ real matrices. For $A,B\in {𝐌}_{m,n}$, we say that $A$ is row Hadamard majorized by $B$ (denoted by $A{\prec }_{RH}B)$ if there exists an $m\times n$ row stochastic matrix $R$ such that $A=R\circ B$, where $X\circ Y$ is the Hadamard product (entrywise product) of matrices $X,Y\in {𝐌}_{m,n}$. In this paper, we consider the concept of row Hadamard majorization as a relation on ${𝐌}_{m,n}$ and characterize the structure of all linear operators $T:{𝐌}_{m,n}\to {𝐌}_{m,n}$ preserving...

By max-plus algebra we mean the set of reals $ℝ$ equipped with the operations $a\oplus b=max\{a,b\}$ and $a\otimes b=a+b$ for $a,b\in ℝ.$ A vector $x$ is said to be a generalized eigenvector of max-plus matrices $A,B\in ℝ(m,n)$ if $A\otimes x=\lambda \otimes B\otimes x$ for some $\lambda \in ℝ$. The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval)...

Let ${𝕄}_{n,m}$ be the set of all $n\times m$ real or complex matrices. For $A,B\in {𝕄}_{n,m}$, we say that $A$ is row-sum majorized by $B$ (written as $A{\prec }^{\mathrm{rs}}B$) if $R\left(A\right)\prec R\left(B\right)$, where $R\left(A\right)$ is the row sum vector of $A$ and $\prec$ is the classical majorization on ${ℝ}^n$. In the present paper, the structure of all linear operators $T:{𝕄}_{n,m}\to {𝕄}_{n,m}$ preserving or strongly preserving row-sum majorization is characterized. Also we consider the concepts of even and circulant majorization on ${ℝ}^n$ and then find the linear preservers of row-sum majorization of these relations on ${𝕄}_{n,m}$. ...

A matrix $A$ is said to have $𝐗$-simple image eigenspace if any eigenvector $x$ belonging to the interval $𝐗=\{x:\underline{x}\le x\le \overline{x}\}$ containing a constant vector is the unique solution of the system $A\otimes y=x$ in $𝐗$. The main result of this paper is an extension of $𝐗$-simplicity to interval max-min matrix $𝐀=\{A:\underline{A}\le A\le \overline{A}\}$ distinguishing two possibilities, that at least one matrix or all matrices from a given interval have $𝐗$-simple image eigenspace. $𝐗$-simplicity of interval matrices in max-min algebra are studied and equivalent conditions for...

A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cube $I^n$. It is nonobtuse if none of its dihedral angles is obtuse, and acute if additionally none of them is right. Acute $0/1$-simplices in $I^n$ can be represented by $0/1$-matrices $P$ of size $n\times n$ whose Gramians $G=P^{\top }P$ have an inverse that is strictly diagonally dominant, with negative off-diagonal entries. In this paper, we will prove that the positive part $D$ of the transposed inverse $P^{-\top }$ of $P$ is doubly stochastic and has the...

The paper deals with logarithmic capacities, an important tool in pluripotential theory. We show that a class of capacities, which contains the L-capacity, has the following product property: $C_{\nu }\left(E₁\times E₂\right)=min(C_{\nu ₁}\left(E₁\right),C_{\nu ₂}\left(E₂\right))$, where $E_j$ and ${\nu }_j$ are respectively a compact set and a norm in ${ℂ}^{N_j}$ (j = 1,2), and ν is a norm in ${ℂ}^{N₁+N₂}$, ν = ν₁⊕ₚ ν₂ with some 1 ≤ p ≤ ∞. For a convex subset E of ${ℂ}^N$, denote by C(E) the standard L-capacity and by ${\omega }_E$ the minimal width of E, that is, the minimal Euclidean distance between two supporting hyperplanes...

We prove some results in the context of isoperimetric inequalities with quantitative terms. In the $2$-dimensional case, our main contribution is a method for determining the optimal coefficients $c_1,...,c_m$ in the inequality $\delta P\left(E\right)\ge {\sum }_{k=1}^m{c}_k\alpha {\left(E\right)}^k+o\left(\alpha {\left(E\right)}^m\right)$, valid for each Borel set $E$ with positive and finite area, with $\delta P\left(E\right)$ and $\alpha \left(E\right)$ being, respectively, the $\mathrm{𝑖𝑠𝑜𝑝𝑒𝑟𝑖𝑚𝑒𝑡𝑟𝑖𝑐𝑑𝑒𝑓𝑖𝑐𝑖𝑡}$ and the $\mathrm{𝐹𝑟𝑎𝑒𝑛𝑘𝑒𝑙𝑎𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑦}$ of $E$. In $n$ dimensions, besides proving existence and regularity properties of minimizers for a wide class of $\mathrm{𝑞𝑢𝑎𝑛𝑡𝑖𝑡𝑎𝑡𝑖𝑣𝑒𝑖𝑠𝑜𝑝𝑒𝑟𝑖𝑚𝑒𝑡𝑟𝑖𝑐𝑞𝑢𝑜𝑡𝑖𝑒𝑛𝑡𝑠}$ including the lower semicontinuous extension of $\frac{\delta P\left(E\right)}{\alpha {\left(E\right)}^2}$, we...

We give the characterization of the unit group of ${𝔽}_{q}SL(2,{\mathbb{Z}}_5)$, where ${𝔽}_q$ is a finite field with $q=p^k$ elements for prime $p>5,$ and $SL(2,{\mathbb{Z}}_5)$ denotes the special linear group of $2\times 2$ matrices having determinant $1$ over the cyclic group ${\mathbb{Z}}_5$.

Let $𝕍$ be a separable real Hilbert space, $k\in \mathbb{N}$ with $k<dim𝕍$, and let $B$ be convex and closed in $𝕍$. Let $𝒫$ be a collection of linear $k$-subspaces of $𝕍$. A point $w\in B$ is called exposed by $𝒫$ if there is a $P\in 𝒫$ so that $(w+P)\cap B=\left\{w\right\}$. We show that, under some natural conditions, $B$ can be reconstituted as the convex hull of the closure of all its exposed by $𝒫$ points whenever $𝒫$ is dense and $G_{\delta }$. In addition, we discuss the question when the set of exposed by some $𝒫$ points forms a $G_{\delta }$-set.

Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a positive definite matrix of some fixed order, say, $s$. Let $D_{ij}$ denote the sum of all the weights lying in the path connecting the vertices $i$ and $j$ of $T$. We now say that $D_{ij}$ is the distance between $i$ and $j$. Define $D:=\left[D_{ij}\right]$, where $D_{ii}$ is the $s\times s$ null matrix and for $i\ne j$, $D_{ij}$ is the distance between $i$ and $j$. Let $G$ be an arbitrary connected weighted graph with $n$ vertices, where each weight is a positive definite matrix of order...

In this paper we prove the following theorems in incidence geometry. 1. There is $\delta >0$ such that for any $P_1,\cdots ,P_4$, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le n^{(1+\delta )/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then $P_1,\cdots ,P_4$ are collinear. If the number of the distinct lines is $<c{n}^{1/2}$ then the cross ratio of the four points is algebraic. 2. Given $c>0$, there is $\delta >0$ such that for any $P_1,P_2,P_3\in {ℂ}^2$ noncollinear, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le c{n}^{1/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then for any $P\in {ℂ}^2\setminus \{P_1,P_2,P_3\}$, we have $\delta n$ distinct lines between $P$ and $Q_j$. 3. Given...

For $X,Y\in {𝐌}_{n,m}$ it is said that $X$ is gut-majorized by $Y$, and we write $X{\prec }_{\mathrm{gut}}Y$, if there exists an $n$-by-$n$ upper triangular g-row stochastic matrix $R$ such that $X=RY$. Define the relation ${\sim }_{\mathrm{gut}}$ as follows. $X{\sim }_{\mathrm{gut}}Y$ if $X$ is gut-majorized by $Y$ and $Y$ is gut-majorized by $X$. The (strong) linear preservers of ${\prec }_{\mathrm{gut}}$ on ${ℝ}^n$ and strong linear preservers of this relation on ${𝐌}_{n,m}$ have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ${\sim }_{\mathrm{gut}}$ on ${ℝ}^n$ and ${𝐌}_{n,m}$.

CONTENTSPART IIntroduction............................................................................................... 31. General solution.................................................................................. 42. Preliminaries and notation................................................................ 53. $C^p$ solutions in $ℭ$*................................................ 74. Change of variables..............................................................................

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

For a finite group $G$ denote by $N\left(G\right)$ the set of conjugacy class sizes of $G$. In 1980s, J. G. Thompson posed the following conjecture: If $L$ is a finite nonabelian simple group, $G$ is a finite group with trivial center and $N\left(G\right)=N\left(L\right)$, then $G\cong L$. We prove this conjecture for an infinite class of simple groups. Let $p$ be an odd prime. We show that every finite group $G$ with the property $Z\left(G\right)=1$ and $N\left(G\right)=N\left(A_i\right)$ is necessarily isomorphic to $A_i$, where $i\in \{2p,2p+1\}$.