AbstractLet Kn denote the set of all nonnegative n×n matrices whose entries have sum n, and let Jn=[1n]n×n. For k = 1,…, n, and for A ∈ Kn with row sum s r1,…, rn and column sums c1,…, cn, let ϕk be defined by ϕk(A) = ∑α, β∈Qk∏i ∈ α ri + ∏j ∈ β cj − per A[α|β]. We propose a problem of maximizing ϕk of which the Dittert conjecture is a special case, and obtain some results related to this problem. Many of known theorems for ϕn are shown to hold for ϕk, k=1,…, n
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
AbstractLet A be an n × p matrix of ± 1's, n ⩾ p. The problem considered is the destination of the m...
Given a sequence of n real numbers a1, a2, a3,..., an, the maximum segment sum problem is that of de...
AbstractLet Kn denote the set of all n X n nonnegative matrices whose entries have sum n, and let φ ...
AbstractLet Kn denote the convex set consisting of all real nonnegative n×n matrices whose entries h...
AbstractLet G be Kn,n with non-negative edge weights and let U and V be the two colour classes of ve...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
We consider the maximizing travelling salesman problem (MTSP) for two special classes of n × n matri...
AbstractLet X and Y be n×n Hermitian matrices with eigenvalues x1⩾x2⩾⋯⩾xn and y1⩾y2⩾⋯⩾yn respectivel...
AbstractWe prove: if (xij) is an m×n matrix with non-negative real entries, which are not all equal ...
AbstractLet A be a matrix of m rows and n columns whose entries are either zero or one with row i of...
Suppose that we have a set of numbers x1,..., xn which have nonnegative sum. How many subsets of k n...
AbstractLet Λnk be the collection of n × n matrices with nonnegative integer coefficients such that ...
AbstractWe study the 0–1 matrices whose squares are still 0–1 matrices and determine the maximal num...
AbstractWe consider the maximizing travelling salesman problem (MTSP) for two special classes of n ×...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
AbstractLet A be an n × p matrix of ± 1's, n ⩾ p. The problem considered is the destination of the m...
Given a sequence of n real numbers a1, a2, a3,..., an, the maximum segment sum problem is that of de...
AbstractLet Kn denote the set of all n X n nonnegative matrices whose entries have sum n, and let φ ...
AbstractLet Kn denote the convex set consisting of all real nonnegative n×n matrices whose entries h...
AbstractLet G be Kn,n with non-negative edge weights and let U and V be the two colour classes of ve...
AbstractLet Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices o...
We consider the maximizing travelling salesman problem (MTSP) for two special classes of n × n matri...
AbstractLet X and Y be n×n Hermitian matrices with eigenvalues x1⩾x2⩾⋯⩾xn and y1⩾y2⩾⋯⩾yn respectivel...
AbstractWe prove: if (xij) is an m×n matrix with non-negative real entries, which are not all equal ...
AbstractLet A be a matrix of m rows and n columns whose entries are either zero or one with row i of...
Suppose that we have a set of numbers x1,..., xn which have nonnegative sum. How many subsets of k n...
AbstractLet Λnk be the collection of n × n matrices with nonnegative integer coefficients such that ...
AbstractWe study the 0–1 matrices whose squares are still 0–1 matrices and determine the maximal num...
AbstractWe consider the maximizing travelling salesman problem (MTSP) for two special classes of n ×...
AbstractLet C={1,2,…,m} and f be a multiplicative function such that (f∗μ)(k)>0 for every positive i...
AbstractLet A be an n × p matrix of ± 1's, n ⩾ p. The problem considered is the destination of the m...
Given a sequence of n real numbers a1, a2, a3,..., an, the maximum segment sum problem is that of de...