An Upper Bound for the Cardinality of an <Emphasis Type="Italic">s</Emphasis>-Distance Set in Euclidean Space

In this paper we show that if X is an s-distance set in ^m and X is on p concentric spheres then Moreover if X is antipodal, then .     

Counting the number of isotone selfmappings of crowns

Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is . The number of all order-preserving selfmappings of a 2n-element crown is

On theq-log-concavity of Gaussian binomial coefficients

We give a combinatorial proof that is a polynomial inq with nonnegative coefficients for nonnegative integersa, b, k, l withab andlk. In particular, fora=b=n andl=k, this implies theq-log-concavity of the Gaussian binomial coefficients , which was conjectured byButler (Proc. Amer. Math. Soc. 101 (1987), 771–775).     

Lyapunov exponent and rotation number for stochastic Dirac operators

In this paper, we consider the stochastic Dirac operatoron a polish space (Ω,β, P). The relation between the Lyapunov index, rotation number andthe spectrum of L_ω is discussed. The existence of the Lyapunov index and rotation number isshown. By using the W-T functions and W-function we prove the theorems for L_ω as in Kotani[1], [2] for Schrodinger operatorB, and in Johnson [5] for Dirac operators on compact space.     

Extensions of hereditary algebras

Let be a triangular matrix algebra, uhere k is an algebraically closed field, B is the path algebra of an oriented Dynkin diagram of type E₆ or E₇ or E₈ and M is a finite dimensional k-B-bimodule. The aim of this paper is to determine the representation type of A for any orientation of the Dynkin diagram and for any indecomposable B-module M. This classification is obtained by comparing the representation types of the algebras and using the theory of tilting modules.     

Hyponormality of Toeplitz Operators with Polynomial and Symmetric-Type Symbols

Suppose that is a trigonometric polynomial of the form (z) = ^N_n=-N a_n zⁿ. It is well-known that T is normal if and only if | a_{– N}| =  | a_N| and the Fourier coefficients of satisfy the following symmetry condition:

Solutions of minimal period for a semilinear wave equation

In questo lavoro si considera il problema

Branching inset entropies on open domains

The forms of all semisymmetric, branching, multidimensional measures of inset information on open domains are determined. This is done for both the complete and the possibly incomplete partition cases. The key to these results is to find the general solution of the functional equation

On some new identities for the Fibonomial coefficients

Let F _n be the nth Fibonacci number. The Fibonomial coefficients \(\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F\) are defined for n ≥ k > 0 as follows $$\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F = \frac{{F_n F_{n - 1} \cdots F_{n - k + 1} }} {{F_1 F_2 \cdots F_k }},$$ with \(\left[ {\begin{array}{*{20}c} n \\ 0 \\ \end{array} } \right]_F = 1\) and \(\left[ {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right]_F = 0\) . In this paper, we shall provide several identities among Fibonomial coefficients. In particular, we prove that $$\sum\limits_{j = 0}^{4l + 1} {\operatorname{sgn} (2l - j)\left[ {\begin{array}{*{20}c} {4l + 1} \\ j \\ \end{array} } \right]_F F_{n - j} = \frac{{F_{2l - 1} }} {{F_{4l + 1} }}\left[ {\begin{array}{*{20}c} {4l + 1} \\ {2l} \\ \end{array} } \right]_F F_{n - 4l - 1} ,}$$ holds for all non-negative integers n and l.     

On a second-order matrix differential operator

We consider the second-order matrix differential operator $$N = \left( {\begin{array}{*{20}c} { - \frac{d}{{dx}}\left( {p_0 \frac{d}{{dx}}} \right) + p_1 } \\ r \\ \end{array} \begin{array}{*{20}c} r \\ { - \frac{d}{{dx}}\left( {q_0 \frac{d}{{dx}}} \right) + q_1 } \\ \end{array} } \right)$$ determined by the expression Nφ, [0 ?x < ∞), where \(\phi = \left( {\begin{array}{*{20}c} U \\ V \\ \end{array} } \right)\) . It has been proved that if p₀, q₀, p₁, q₁,r satisfy certain conditions, then N is in the limit point case at ∞. It has been also shown that certain differential operators in the Hilbert space L² of vectors, generated by the operator N, are symmetric and self-adjoint.     

A Minimal-Automaton-Based Algorithm for the Reliability of Con(d,k, n) Systems

A d-within-consecutive-k-out-of-n system, abbreviated as Con(d, k, n), is a linear system of n components in a line which fails if and only if there exists a set of k consecutive components containing at least d failed ones. So far the fastest algorithm to compute the reliability of Con(d, k, n) is Hwang and Wright's algorithm published in 1997, where . In this paper we use automata theory to reduce to . For d small or close to k, we have reduced from exponentially many (in k) to polynomially many. The computational complexity of our final algorithm is , where .     

The number of strictly increasing mappings of fences

Let X and Y be fences of size n and m, respectively and n, m be either both even or both odd integers (i.e., |m-n| is an even integer). Let \(r = \left\lfloor {{{(n - 1)} \mathord{\left/ {\vphantom {{(n - 1)} 2}} \right. \kern-0em} 2}} \right\rfloor\) . If 1<n<-m then there are \(a_{n,m} = (m + 1)2^{n - 2} - 2(n - 1)(\begin{array}{*{20}c} {n - 2} \\ r \\ \end{array} )\) of strictly increasing mappings of X to Y. If 1<-m<-n<-2m and s=1/2(n?m) then there are a _n,m+b _n,m+c _n of such mappings, where $$\begin{gathered} b_{n,m} = 8\sum\limits_{i = 0}^{s - 2} {\left( {\begin{array}{*{20}c} {m + 2i + 1} \\ l \\ \end{array} } \right)4^{s - 2 - 1} } \hfill \\ {\text{ }}c_n = \left\{ \begin{gathered} \left( {\begin{array}{*{20}c} {n - 1} \\ {s - 1} \\ \end{array} } \right){\text{ if both }}n,m{\text{ are even;}} \hfill \\ {\text{ 0 if both }}n,m{\text{ are odd}}{\text{.}} \hfill \\ \end{gathered} \right. \hfill \\ \end{gathered} $$      

Eigenvalues of the Dirac operator in the continuous spectrum

Functionsp(x) andq(x) for which the Dirac operator $$Dy = \left( {\begin{array}{*{20}c} {\begin{array}{*{20}c} 0 \\ { - 1} \\ \end{array} } & {\begin{array}{*{20}c} 1 \\ 0 \\ \end{array} } \\ \end{array} } \right)\frac{{dy}}{{dx}} + \left( {\begin{array}{*{20}c} {p(x) q(x)} \\ {q(x) - p(x)} \\ \end{array} } \right)y = \lambda y, y = \left( {\begin{array}{*{20}c} {y_1 } \\ {y_2 } \\ \end{array} } \right), y_1 (0) = 0,$$ has a countable number of eigenvalues in the continuous spectrum are constructed.     

Gauss polynomials and the rotation algebra

Newton's binomial theorem is extended to an interesting noncommutative setting as follows: If, in a ring,ba=ab with commuting witha andb, then the (generalized) binomial coefficient arising in the expansion

How to find many counterfeit coins?

We propose an algorithm for findingm defective coins, that uses at most + 15m weighings on a balance scale, wheren is the number of all coins.     

Bifurcation problems for superlinear elliptic indefinite equations with exponential growth

This paper deals with the existence and the behaviour of global connected branches of positive solutions of the problem

An Inverse Spectral Problem for a Nonsymmetric Differential Operator: Uniqueness and Reconstruction Formula

We consider an eigenvalue problem for a system on [0, 1]: $$\left\{ {\begin{array}{*{20}l} {\left[ {\left( {\begin{array}{*{20}c} 0 & 1 \\ 1 & 0 \\ \end{array} } \right)\frac{{\text{d}}} {{{\text{d}}x}} + \left( {\begin{array}{*{20}c} {p_{11} (x)} & {p_{12} (x)} \\ {p_{21} (x)} & {p_{22} (x)} \\ \end{array} } \right)} \right]\left( {\begin{array}{*{20}c} {\varphi ^{(1)} (x)} \\ {\varphi ^{(2)} (x)} \\ \end{array} } \right) = \lambda \left( {\begin{array}{*{20}c} {\varphi ^{(1)} (x)} \\ {\varphi ^{(1)} (x)} \\ \end{array} } \right)} \\ {\varphi ^{(2)} (0)\cosh \mu - \varphi ^{(1)} (0)\sinh \mu = \varphi ^{(2)} (1)\cosh \nu + \varphi ^{(1)} (1)\sinh \nu = 0} \\ \end{array} } \right.$$ with constants $$\mu ,\nu \in \mathbb{C}.$$ Under the assumption that p₂₁, p₂₂ are known, we prove a uniqueness theorem and provide a reconstruction formula for p₁₁ and p₁₂ from the spectral characteristics consisting of one spectrum and the associated norming constants.     

Enumerating rooted simple planar maps

The main purpose of this paper is to find the number of combinatorially distinct rooted simpleplanar maps,i.e.,maps having no loops and no multi-edges,with the edge number given.We haveobtained the following results.1.The number of rooted boundary loopless planar [m,2]-maps.i.e.,maps in which there areno loops on the boundaries of the outer faces,and the edge number is m,the number of edges on theouter face boundaries is 2,is(?)for m≥1.G_0~N=0.2.The number of rooted loopless planar [m,2]-maps is(?)3.The number of rooted simple planar maps with m edges H_m~s satisfies the following recursiveformula:(?)where H_m~(NL) is the number of rooted loopless planar maps with m edges given in [2].4.In addition,γ(i,m),i≥1,are determined by(?)for m≥i.γ(i,j)=0,when i>j.     

The formula for the number of order-preserving selfmappings of a fence

LetY be a fence of sizem andr=?m?1/2?. The numberb(m) of order-preserving selfmappings ofY is equal toA _r-B_r-C_r-D_r, where, ifm is odd, $$\begin{gathered} A_r = 2(r + 1)\sum\limits_{s = 0}^r {\left( {\begin{array}{*{20}c} {r + s} \\ {2s} \\ \end{array} } \right)} 4^s , B_r = 2r\sum\limits_{s = 1}^r {\left( {\begin{array}{*{20}c} {r + s} \\ s \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {r - 1} \\ {s - 1} \\ \end{array} } \right),} \hfill \\ C_r = 4r\sum\limits_{s = 0}^{r - 1} {\left( {\begin{array}{*{20}c} {r + s} \\ s \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {r - 1} \\ s \\ \end{array} } \right), D_r = \sum\limits_{s = 0}^{r - 1} {(2s + 1)} \left( {\begin{array}{*{20}c} {r + s - 1} \\ s \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {r - 1} \\ s \\ \end{array} } \right)} \hfill \\ \end{gathered} $$ . Ifm is even, a similar formula forb(m) is true. The key trick in the proof is a one-to-one correspondence between order-preserving selfmappings ofY and pairs consisted of a partition ofY and a strictly increasing mapping of a subfence ofY toY.     

An explicit formula for |FM(1+1+n)|

We show that the number of elements in FM(1+1+n), the modular lattice freely generated by two single elements and an n-element chain, is 1 $$\frac{1}{{6\sqrt 2 }}\sum\limits_{k = 0}^{n + 1} {\left[ {2\left( {\begin{array}{*{20}c} {2k} \\ k \\ \end{array} } \right) - \left( {\begin{array}{*{20}c} {2k} \\ {k - 2} \\ \end{array} } \right)} \right]} \left( {\lambda _1^{n - k + 2} - \lambda _2^{n - k + 2} } \right) - 2$$ , where \(\lambda _{1,2} = {{\left( {4 \pm 3\sqrt 2 } \right)} \mathord{\left/ {\vphantom {{\left( {4 \pm 3\sqrt 2 } \right)} 2}} \right. \kern-0em} 2}\) .