Curvature inequalities for operators of the Cowen–Douglas class

Let T be an operator tuple in the Cowen–Douglas class B _n (Ω) for Ω ? C ^m . The kernels Ker(T ? w) ^l , for w ∈ Ω, l = 1, 2, ···, define Hermitian vector bundles E _T ^l over Ω. We prove certain negativity of the curvature of E _T ^l . We also study the relation between certain curvature inequality and the contractive property of T when Ω is a planar domain.     

Synthesis of easy tested diagrams in the basis {&;, ∨, <Superscript>−</Superscript>} for systems of functions from some classes

A new method for synthesis of easy tested diagrams of functional elements in the basis {&;, ∨, ^?} is proposed for systems of m Boolean functions differing from constants and representable as disjunctive normal forms containing l variables x ₁,...,x _l , l > 0, without negations and the other variables x _l+1,...,x _n with negations only. All faults are assumed to be stack-at-1 faults at the outputs of elements. It is proved that the length of a complete verification test is not greater than min {m, l} for such diagrams.     

Structural properties and enumeration of 1-generator generalized quasi-cyclic codes

Let F _q be a finite field of cardinality q, m ₁, m ₂, . . . , m _l be any positive integers, and \({A_i=F_q[x]/(x^{m_i}-1)}\) for i = 1, . . . , l. A generalized quasi-cyclic (GQC) code of block length type (m ₁, m ₂, . . . , m _l ) over F _q is defined as an F _q [x]-submodule of the F _q [x]-module \({A_1\times A_2\times\cdots\times A_l}\). By the Chinese Remainder Theorem for F _q [x] and enumeration results of submodules of modules over finite commutative chain rings, we investigate structural properties of GQC codes and enumeration of all 1-generator GQC codes and 1-generator GQC codes with a fixed parity-check polynomial respectively. Furthermore, we give an algorithm to count numbers of 1-generator GQC codes.     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

Two-stage flexible flow shop scheduling subject to fixed job sequences

This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that n _l jobs per type l∈{1, …, m} are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m²Π_l=1 ^m n _l ²) dynamic programming algorithm coupled with numerical experiments is presented.     

Lattices generated by joins of the flats in orbits under finite affine-singular symplectic group and its characteristic polynomials

Let ASG(2ν + l, ν;F _q ) be the (2ν + l)-dimensional affine-singular symplectic space over the finite field F _q and ASp_2ν+l,ν (F _q ) be the affine-singular symplectic group of degree 2ν + l over F _q . Let O be any orbit of flats under ASp_2ν+l,ν (F _q ). Denote by L ^J the set of all flats which are joins of flats in O such that O ? L ^J and assume the join of the empty set of flats in ASG(2ν + l, ν;F _q ) is ?. Ordering L ^J by ordinary or reverse inclusion, then two lattices are obtained. This paper firstly studies the inclusion relations between different lattices, then determines a characterization of flats contained in a given lattice L ^J , when the lattices form geometric lattice, lastly gives the characteristic polynomial of L ^J .     

A Note on Generalized Lagrangians of Non-uniform Hypergraphs

Set \(A\subset {\mathbb N}\) is less than \(B\subset {\mathbb N}\) in the colex ordering if m a x(A△B)∈B. In 1980’s, Frankl and Füredi conjectured that the r-uniform graph with m edges consisting of the first m sets of \({\mathbb N}^{(r)}\) in the colex ordering has the largest Lagrangian among all r-uniform graphs with m edges. A result of Motzkin and Straus implies that this conjecture is true for r=2. This conjecture seems to be challenging even for r=3. For a hypergraph H=(V,E), the set T(H)={|e|:e∈E} is called the edge type of H. In this paper, we study non-uniform hypergraphs and define L(H) a generalized Lagrangian of a non-uniform hypergraph H in which edges of different types have different weights. We study the following two questions: 1. Let H be a hypergraph with m edges and edge type T. Let C _m,T denote the hypergraph with edge type T and m edges formed by taking the first m sets with cardinality in T in the colex ordering. Does L(H)≤L(C _m,T ) hold? If T={r}, then this question is the question by Frankl and Füredi. 2. Given a hypergraph H, find a minimum subhypergraph G of H such that L(G) = L(H). A result of Motzkin and Straus gave a complete answer to both questions if H is a graph. In this paper, we give a complete answer to both questions for {1,2}-hypergraphs. Regarding the first question, we give a result for {1,r ₁,r ₂,…,r _l }-hypergraph. We also show the connection between the generalized Lagrangian of {1,r ₁,r ₂,? ,r _l }-hypergraphs and {r ₁,r ₂,? ,r _l }-hypergraphs concerning the second question.     

An improvement of the five halves theorem of J. Boardman

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = ∪ _j=0 ⁿ F ^j (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. The famous Five Halves Theorem of J. Boardman, announced in 1967, establishes that, if F is nonbounding, then m ≤ 5/2n. In this paper we obtain an improvement of the Five Halves Theorem when the top dimensional component of F, F ⁿ , is nonbounding. Specifically, let ω = (i ₁, i ₂, …, i _r ) be a non-dyadic partition of n and s _ω (x ₁, x ₂, …, x _n ) the smallest symmetric polynomial over Z ₂ on degree one variables x ₁, x ₂, …, x _n containing the monomial \(x_1^{i_1 } x_2^{i_2 } \cdots x_r^{i_r }\). Write s _ω (F ⁿ ) ∈ H ⁿ (F ⁿ , Z ₂) for the usual cohomology class corresponding to s _ω (x ₁, x ₂, …, x _n ), and denote by ?(F ⁿ ) the minimum length of a nondyadic partition ω with s _ω (F ⁿ ) ≠ 0 (here, the length of ω = (i ₁, i ₂, …, i _r ) is r). We will prove that, if (M ^m , T) is an involution for which the top dimensional component of the fixed point set, F ⁿ , is nonbounding, then m ≤ 2n + ?(F ⁿ ); roughly speaking, the bound for m depends on the degree of decomposability of the top dimensional component of the fixed point set. Further, we will give examples to show that this bound is best possible.     

Groups lying between steinberg groups over nonperfect fields of characteristics 2 and 3

We describe groups lying between Steinberg groups of type ² A _l , ² D _l , ² E ₆, or ³ D ₄ over different fields of characteristics 2 and 3 in the case where the larger field is an algebraic extension of the smaller nonperfect field.     

Optimal cubature formulas for calculation of multidimensional integrals in weighted Sobolev spaces

Optimal cubature formulas are constructed for calculations of multidimensional integrals in weighted Sobolev spaces. We consider some classes of functions defined in the cube Ω = [-1, 1]^l, l = 1, 2,..., and having bounded partial derivatives up to the order r in Ω and the derivatives of jth order (r < j ≤ s) whose modulus tends to infinity as power functions of the form (d(x, Г))^-(j-r), where x ∈ Ω Г, x = (x₁,..., x_l), Г = ?Ω, and d(x, Г) is the distance from x to Г.     

On the approximation of continuous functions of two variables

It is shown that if P _m ^α,β (x) (α, β > ?1, m = 0, 1, 2, …) are the classical Jaboci polynomials, then the system of polynomials of two variables {Ψ _mn ^α,β (x, y)} _m,n=0 ^r = {P _m ^α,β (x)P _n ^α,β (y)} _{m, n=0} ^r (r = m + n ≤ N ? 1) is an orthogonal system on the set Ω _N×N = ?ub;(x _i , y _i ) _i,j=0 ^N , where x _i and y _i are the zeros of the Jacobi polynomial P _n ^α,β (x). Given an arbitrary continuous function f(x, y) on the square [?1, 1]², we construct the discrete partial Fourier-Jacobi sums of the rectangular type S _{m, n, N} ^α,β (f; x, y) by the orthogonal system introduced above. We prove that the order of the Lebesgue constants ∥S _{m, n, N} ^α,β ∥ of the discrete sums S _{m, n, N} ^α,β (f; x, y) for ?1/2 < α, β < 1/2, m + n ≤ N ? 1 is O((mn) ^{q + 1/2}), where q = max?ub;α,β?ub;. As a consequence of this result, several approximate properties of the discrete sums S _{m, n, N} ^α,β (f; x, y) are considered.     

Positivity Criteria Generalizing the Leading Principal Minors Criterion

An n×n Hermitian matrix is positive definite if and only if all leading principal minors Δ₁, . . . ,Δ_n are positive. We show that certain sums δ _l of l × l principal minors can be used instead of Δ _l in this criterion. We describe all suitable sums δ _l for 3 × 3 Hermitian matrices. For an n×n Hermitian matrix A partitioned into blocks A _ij with square diagonal blocks, we prove that A is positive definite if and only if the following numbers σ _l are positive: σ _l is the sum of all l × l principal minors that contain the leading block submatrix [A _ij ] ^{k ?1} _{i,j =1} (if k > 1) and that are contained in [A _ij ] ^k _{i,j =1}, where k is the index of the block A _kk containing the (l, l) diagonal entry of A. We also prove that σ _l can be used instead of Δ _l in other inertia problems.     

Generalized competition index of primitive digraphs

For any positive integers k and m, the k-step m-competition graph C _m ^k (D) of a digraph D has the same set of vertices as D and there is an edge between vertices x and y if and only if there are distinct m vertices v₁, v₂, · · ·, v _m in D such that there are directed walks of length k from x to v _i and from y to v _i for all 1 ≤ i ≤ m. The m-competition index of a primitive digraph D is the smallest positive integer k such that C _m ^k (D) is a complete graph. In this paper, we obtained some sharp upper bounds for the m-competition indices of various classes of primitive digraphs.     

Bent functions with stronger nonlinear properties: K-bent functions

We introduce the notion of k-bent function, i.e., a Boolean functionwith evennumber m of variables υ ₁, …, υ _m which can be approximated with all functions of the form 〈u, v〉 _j ⊕ a in the equally poor manner, where u ∈ ? ₂ ^m , a ∈ ?₂, and 1 ? j ? k. Here 〈·, ·〉 _j is an analog of the inner product of vectors; k changes from 1 to m/2. The operations 〈·, ·〉 _k , 1 ? k ? m/2, are defined by using the special series of binary Hadamard-like codes A _m ^k of length 2 ^m . Namely, the vectors of values for the functions 〈u, v〉 _k ⊕ a are codewords of the code A _m ^k . The codes A _m ^k are constructed using subcodes of the ?₄-linear Hadamard-like codes of length 2 ^m+1, which were classified by D. S. Krotov (2001). At that the code A _m ¹ is linear and A _m ¹ , …, A _m ^m/2 are pairwise nonequivalent. On the codewords of a code A _m ^k , we define a group operation ? coordinated with the Hamming metric. That is why we can consider k-bent functions as functions that are maximal nonlinear in k distinct senses of linearity at the same time. Bent functions in usual sense coincide with 1-bent functions. For k > ? ? 1, the class of k-bent functions is a proper subclass of the class of ?-bent functions. In the paper, we give methods for constructing k-bent functions and study their properties. It is shown that there exist k-bent functions with an arbitrary algebraic degree d, where 2 ? d ? max {2, m/2 ? k + 1}. Given an arbitrary k, we define the subset \(\mathfrak{F}_m^k \mathcal{F}_m^k \) of the set \(\mathfrak{F}_m^k \mathcal{F}_m^k \) \(\mathcal{A}_m^k \mathcal{B}_m^k \) of all Boolean functions in m variables with the following property: on this subset k-bent functions and 1-bent functions coincide.     

Choiceless Ramsey Theory of Linear Orders

Motivated by work of Erd?s, Milner and Rado, we investigate symmetric and asymmetric partition relations for linear orders without the axiom of choice. The relations state the existence of a subset in one of finitely many given order types that is homogeneous for a given colouring of the finite subsets of a fixed size of a linear order. We mainly study the linear orders 〈 ^α 2,< _{l e x} 〉, where α is an infinite ordinal and < _{l e x} is the lexicographical order. We first obtain the consistency of several partition relations that are incompatible with the axiom of choice. For instance we derive partition relations for 〈 ^ω 2,< _{l e x} 〉 from the property of Baire for all subsets of ^ω 2 and show that the relation \(\langle ^{\kappa }{2}, <_{lex}\rangle \longrightarrow (\langle ^{\kappa }{2}, <_{lex}\rangle )^{2}_{2}\) is consistent for uncountable regular cardinals κ with κ ^<κ = κ. We then prove a series of negative partition relations with finite exponents for the linear orders 〈 ^α 2,< _{l e x} 〉. We combine the positive and negative results to completely classify which of the partition relations \(\langle ^{\omega }{2}, <_{lex}\rangle \longrightarrow (\bigvee _{\nu <\lambda }K_{\nu },\bigvee _{\nu <\mu }M_{\nu })^{m}\) for linear orders K _ν ,M _ν and m≤4 and 〈 ^ω 2,< _{l e x} 〉→(K,M) ⁿ for linear orders K,M and natural numbers n are consistent.     

Spectral invariant subalgebras of reduced groupoid <Emphasis Type="Italic">C</Emphasis>*-algebras

We introduce the notion of property (RD) for a locally compact, Hausdorff and r-discrete groupoid G, and show that the set S ₂ ^l (G) of rapidly decreasing functions on G with respect to a continuous length function l is a dense spectral invariant and Fréchet *-subalgebra of the reduced groupoid C*-algebra C _r ^* (G) of G when G has property (RD) with respect to l, so the K-theories of both algebras are isomorphic under inclusion. Each normalized cocycle c on G, together with an invariant probability measure on the unit space G ⁰ of G, gives rise to a canonical map τ _c on the algebra C _c (G) of complex continuous functions with compact support on G. We show that the map τ _c can be extended continuously to S ₂ ^l (G) and plays the same role as an n-trace on C _r ^* (G) when G has property (RD) and c is of polynomial growth with respect to l, so the Connes’ fundament paring between the K-theory and the cyclic cohomology gives us the K-theory invariants on C _r ^* (G).     

Controlling noise error in block iterative methods

This paper describes a new \(O(N^{\frac {3}{2}}\log (N))\) solver for the symmetric positive definite Toeplitz system T_Nx_N = b_N. The method is based on the block QR decomposition of T_N accompanied with Levinson algorithm and its generalized version for solving Schur complements S_m of size m. In our algorithm we use a formula for displacement rank representation of the S_m in terms of generating vectors of the matrix T_N, and we assume that N = lm with \(l, m\in \mathbb {N}\). The new algorithm is faster than the classical O(N²)-algorithm for N > 2⁹. Numerical experiments confirm the good computational properties of the new method.     

The product of octahedra is badly approximated in the <Emphasis Type="Italic">ℓ</Emphasis><Subscript>2,1</Subscript>-metric

We prove that the Cartesian product of octahedra B _1,∞ ^n,m = B ₁ ⁿ ×···× B ₁ ⁿ (m factors) is poorly approximated by spaces of half dimension in the mixed norm: d _N/2(B _1,∞ ^n,m , ? _2,1 ^n,m ) ≥ cm, N = mn. As a corollary, we find the order of linear widths of the Hölder–Nikol’skii classes H _p ^r (T ^d ) in the metric of L _q in certain domains of variation of the parameters (p, q).     

Critical exponent for a quasilinear parabolic equation with inhomogeneous density in a cone

In this paper, we study the initial-boundary value problem of porous medium equation ρ(x)u _t  = Δu ^m  + V(x)h(t)u ^p in a cone D = (0, ∞) × Ω, where \({V(x)\,{\sim}\, |x|^\sigma, h(t)\,{\sim}\, t^s}\). Let ω ₁ denote the smallest Dirichlet eigenvalue for the Laplace-Beltrami operator on Ω and let l denote the positive root of l ² + (n ? 2)l = ω ₁. We prove that if \({m < p \leq 1+(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}\), then the problem has no global nonnegative solutions for any nonnegative u ₀ unless u ₀ = 0; if \({p >1 +(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}\), then the problem has global solutions for some u ₀ ≥ 0.     

Word maps and word maps with constants of simple algebraic groups

In the present paper, we consider word maps w: G ^m → G and word maps with constants w _Σ: G ^m → G of a simple algebraic group G, where w is a nontrivial word in the free group F _m of rank m, w _Σ = w ₁ σ ₁ w ₂ ··· w _r σ _r w _{r + 1}, w ₁, …, w _{r + 1} ∈ F _m , w ₂, …, w _r ≠ 1, Σ = {σ ₁, …, σ _r | σ _i ∈ G Z(G)}. We present results on the images of such maps, in particular, we prove a theorem on the dominance of “general” word maps with constants, which can be viewed as an analogue of a well-known theorem of Borel on the dominance of genuine word maps. Besides, we establish a relationship between the existence of unipotents in the image of a word map and the structure of the representation variety R(Γ_w, G) of the group Γ_w = F _m /<w>.