The <Emphasis Type="Italic">p</Emphasis>-Adic order of the <Emphasis Type="Italic">k</Emphasis>-Fibonacci and <Emphasis Type="Italic">k</Emphasis>-Lucas numbers

Let (F _k,n ) _n and (L _k,n )n be the k-Fibonacci and k-Lucas sequence, respectively, which satisfies the same recursive relation a _n+1 = ka _n + a _n?1 with initial values F _k,0 = 0, F _k,1 = 1, L _k,0 = 2 and L _k,1 = k. In this paper, we characterize the p-adic orders ν _p (F _k,n ) and ν _p (L _k,n ) for all primes p and all positive integers k.     

The existence of eigenvalues for operators acting in <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>(<Emphasis Type="Italic">R</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

We present conditions that allow us to prove the existence of eigenvalues and characteristic values for operator F(D) ? C(λ): L ²(R ^m ) → L ²(R ^m ), where F(D) is a pseudo-differential operator with a symbol F(iξ) and C(λ): L ²(R ^m ) → L ²(R ^m ) is a linear continuous operator.     

The Center of <Emphasis Type="Italic">Dist</Emphasis> (<Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">m</Emphasis>|<Emphasis Type="Italic">n</Emphasis>)) in Positive Characteristic

The purpose of this paper is to investigate central elements in distribution algebras D i s t(G) of general linear supergroups G = G L(m|n). As an application, we compute explicitly the center of D i s t(G L(1|1)) and its image under Harish-Chandra homomorphism.     

Note edge-colourings of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n,n</Emphasis></Subscript> with no long two-coloured cycles

Consider the set of all proper edge-colourings of a graph G with n colours. Among all such colourings, the minimum length of a longest two-coloured cycle is denoted L(n, G). The problem of understanding L(n, G) was posed by Häggkvist in 1978 and, specifically, L(n, K _n,n ) has received recent attention. Here we construct, for each prime power q ≥ 8, an edge-colouring of K _n,n with n colours having all two-coloured cycles of length ≤ 2q ², for integers n in a set of density 1 ? 3/(q ? 1). One consequence is that L(n, K _n,n ) is bounded above by a polylogarithmic function of n, whereas the best known general upper bound was previously 2n ? 4.     

On <Emphasis Type="Italic">k</Emphasis>- critical 2<Emphasis Type="Italic">k</Emphasis>- connected graphs

A graph G is called an (n,k)-graph if κ(G-S)=n-|S| for any S ? V(G) with |S| ≤ k, where ?(G) denotes the connectivity of G. Mader conjectured that for k ≥ 3 the graph K_2k+2?(1-factor) is the unique (2k, k)-graph. Kriesell has settled two special cases for k = 3,4. We prove the conjecture for the general case k ≥ 5.     

The characterization of a class of quantum Markov semigroups and the associated operator-valued Dirichlet forms based on Hilbert <Emphasis Type="Italic">C</Emphasis>*-module <Emphasis Type="Italic">l</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">A</Emphasis>)

We characterize A-linear symmetric and contraction module operator semigroup{Tt}t∈R+L(l2(A)),where A is a finite-dimensional C-algebra,and L(l2(A))is the C-algebra of all adjointable module maps on l2(A).Next,we introduce the concept of operator-valued quadratic forms,and give a one to one correspondence between the set of non-positive definite self-adjoint regular module operators on l2(A)and the set of non-negative densely defined A-valued quadratic forms.In the end,we obtain that a real and strongly continuous symmetric semigroup{Tt}t∈R+L(l2(A))being Markovian if and only if the associated closed densely defined A-valued quadratic form is a Dirichlet form.     

Asymptotics of the Codimensions <Emphasis Type="Italic">c</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> in the Algebra <Emphasis Type="Italic">F</Emphasis><Superscript>(7)</Superscript>

The paper studies the additive structure of the algebra F⁽⁷⁾, i.e., a relatively free associative countably generated algebra with the identity [x₁,..., x₇] = 0 over an infinite field of characteristic ≠ 2, 3. First, the space of proper multilinear polynomials in this algebra is investigated. As an application, estimates for the codimensions c_n = dimF_n⁽⁷⁾ are obtained, where F_n⁽⁷⁾ stands for the subspace of multilinear polynomials of degree n in the algebra F⁽⁷⁾.     

Periodic Groups Saturated with the Groups <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

Given an indexing set I and a finite field K_α for each α ∈ I, let ? = {L₂(K_α) | α ∈ I} and \(\mathfrak{N} = \{ SL_2 (K_\alpha )|\alpha \in I\}\). We prove that each periodic group G saturated with groups in \(\Re (\mathfrak{N})\) is isomorphic to L₂(P) (respectively SL₂(P)) for a suitable locally finite field P.     

On a new property of <Emphasis Type="Italic">n</Emphasis>-poised and <Emphasis Type="Italic">G</Emphasis><Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> sets

In this paper we consider n-poised planar node sets, as well as more special ones, called G C _n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C _n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C _n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C _n sets. At the end we present a conjecture concerning any k-node line.     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

On (<Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-absorbing ideals of commutative rings

Let R be a commutative ring with 1 ≠ 0 and U(R) be the set of all unit elements of R. Let m, n be positive integers such that m > n. In this article, we study a generalization of n-absorbing ideals. A proper ideal I of R is called an (m, n)-absorbing ideal if whenever a ₁?a _m ∈I for a ₁,…, a _m ∈R?U(R), then there are n of the a _i ’s whose product is in I. We investigate the stability of (m, n)-absorbing ideals with respect to various ring theoretic constructions and study (m, n)-absorbing ideals in several commutative rings. For example, in a Bézout ring or a Boolean ring, an ideal is an (m, n)-absorbing ideal if and only if it is an n-absorbing ideal, and in an almost Dedekind domain every (m, n)-absorbing ideal is a product of at most m ? 1 maximal ideals.     

Pointwise estimates of polynomials orthogonal on a circle with respect to a weight not belonging to the spaces <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript> (<Emphasis Type="Italic">r</Emphasis> &gt; 1)

Two-sided pointwise estimates are established for polynomials that are orthogonal on the circle |z| = 1 with respect to the weight ?(τ): = h(τ)|sin(τ/2)|^?1 g(|sin(τ/2)|) (τ ∈ ?), where g(t) is a concave modulus of continuity slowly changing at zero such that t ^?1 g(t) ∈ L ¹[0, 1] and h(τ) is a positive function from the class C _2π with a modulus of continuity satisfying the integral Dini condition. The obtained estimates are applied to find the order of the distance from the point t = 1 to the greatest zero of a polynomial orthogonal on the segment [?1, 1].     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

Some relations among multiplicative and <Emphasis Type="Italic">q</Emphasis>-additive functions

We give all solutions of the equation f(n) = g(n) + h(n) for every n ∈ ?, where f is a completely multiplicative, g is a 2-additive, and h is a 3-additive function. We also determine all completely multiplicative functions f and all q-additive functions g for which f(n) = g ²(n) for every n ∈ ?.     

Family algebras and generalized exponents for polyvector representations of simple Lie algebras of type <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We give an explicit formula for the exterior powers ∧ ^k π ₁ of the defining representation π ₁ of the simple Lie algebra ?ο(2n + 1, ?). We use the technique of family algebras. All representations in question are children of the spinor representation σ of g2ο(2n + 1, ?). We also give a survey of main results on family algebras.     

The dual space of <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> of a vector measure

For a vector measure ν having values in a real or complex Banach space and \({p \in}\) [1, ∞), we consider L ^p (ν) and \({L_{w}^{p}(\nu)}\), the corresponding spaces of p-integrable and scalarly p-integrable functions. Given μ, a Rybakov measure for ν, and taking q to be the conjugate exponent of p, we construct a μ-Köthe function space E _q (μ) and show it is σ-order continuous when p > 1. In this case, for the associate spaces we prove that L ^p (ν) ^×  = E _q (μ) and \({E_q(\mu)^\times = L_w^p(\nu)}\). It follows that \({L_p (\nu) ^{**} = L_w^p (\nu)}\). We also show that L ¹ (ν) ^×  may be equal or not to E _∞ (μ).     

Strictly singular operators in pairs of <Emphasis Type="Italic">L</Emphasis> <Subscript> <Emphasis Type="Italic">p</Emphasis> </Subscript> space

Let E and F be Banach spaces. A linear operator from E to F is said to be strictly singular if, for any subspace Q ? E, the restriction of A to Q is not an isomorphism. A compactness criterion for any strictly singular operator from L_p to L_q is found. There exists a strictly singular but not superstrictly singular operator on L_p, provided that p ≠ 2.     

On the phase transitions of (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)-SAT

Call a sequence of k Boolean variables or their negations a k-tuple. For a set V of n Boolean variables, let T _k (V) denote the set of all 2 ^k n ^k possible k-tuples on V. Randomly generate a set C of k-tuples by including every k-tuple in T _k (V) independently with probability p, and let Q be a given set of q “bad” tuple assignments. An instance I = (C,Q) is called satisfiable if there exists an assignment that does not set any of the k-tuples in C to a bad tuple assignment in Q. Suppose that θ, q > 0 are fixed and ε = ε(n) > 0 be such that εlnn/lnlnn→∞. Let k ≥ (1 + θ) log₂ n and let \({p_0} = \frac{{\ln 2}}{{q{n^{k - 1}}}}\). We prove that

$$\mathop {\lim }\limits_{n \to \infty } P\left[ {I is satisfiable} \right] = \left\{ {\begin{array}{*{20}c} {1,} & {p \leqslant (1 - \varepsilon )p_0 ,} \\ {0,} & {p \geqslant (1 + \varepsilon )p_0 .} \\ \end{array} } \right.$$

     

(<Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)-central Riordan arrays and their applications

For integers m > r ≥ 0, Brietzke (2008) defined the (m, r)-central coefficients of an infinite lower triangular matrix G = (d, h) = (d_n,k)_n,k∈N as d_{mn+r,(m?1)n+r}, with n = 0, 1, 2,..., and the (m, r)-central coefficient triangle of G as

$${G^{\left( {m,r} \right)}} = {\left( {{d_{mn + r,\left( {m - 1} \right)n + k + r}}} \right)_{n,k \in \mathbb{N}}}.$$

It is known that the (m, r)-central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array G = (d, h) with h(0) = 0 and d(0), h′(0) ≠ 0, we obtain the generating function of its (m, r)-central coefficients and give an explicit representation for the (m, r)-central Riordan array G^(m,r) in terms of the Riordan array G. Meanwhile, the algebraic structures of the (m, r)-central Riordan arrays are also investigated, such as their decompositions, their inverses, and their recessive expressions in terms of m and r. As applications, we determine the (m, r)-central Riordan arrays of the Pascal matrix and other Riordan arrays, from which numerous identities are constructed by a uniform approach.

     

The strong <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-<Emphasis Type="Italic">greedy</Emphasis> property of the Walsh system

For any 0 < ? < 1 one can find a measurable set E ? [0, 1] with the measure |E| > 1 ? ? such that for each function f(x) ε L ¹ (0, 1) a function g(x) ε L ¹ (0, 1) exists such that it coincides with f (x) on E, its Fourier—Walsh series converges to it in the metric of L ¹ (0, 1), and all nonzero terms of the sequence of Fourier coefficients of the new function obtained by the Walsh system have the modulo decreasing order; consequently, the greedy algorithm for this function converges to it in the L ¹ (0, 1)-norm.