Stability of the Kolmogorov flow and its modifications

Recurrence formulas are obtained for the kth term of the long wavelength asymptotics in the stability problem for general two-dimensional viscous incompressible shear flows. It is shown that the eigenvalues of the linear eigenvalue problem are odd functions of the wave number, while the critical values of viscosity are even functions. If the velocity averaged over the long period is nonzero, then the loss of stability is oscillatory. If the averaged velocity is zero, then the loss of stability can be monotone or oscillatory. If the deviation of the velocity from its period-average value is an odd function of spatial variable about some x ₀, then the expansion coefficients of the velocity perturbations are even functions about x ₀ for even powers of the wave number and odd functions about for x ₀ odd powers of the wave number, while the expansion coefficients of the pressure perturbations have an opposite property. In this case, the eigenvalues can be found precisely. As a result, the monotone loss of stability in the Kolmogorov flow can be substantiated by a method other than those available in the literature.     

Recurrence formulas for long wavelength asymptotics in the problem of shear flow stability

Recurrence formulas are obtained for the kth term of the long wavelength asymptotics in the stability problem for two-dimensional viscous incompressible shear flows with a nonzero average. It is shown that the critical eigenvalues are odd functions of the wave number, while the critical values of the viscosity are even functions. If the deviation of the velocity from its period-average value is an odd function of spatial variable, the eigenvalues can be found exactly.     

Characteristics of highly nonlinear functions

The highly nonlinear odd-dimensional Boolean-functions have many applications in the cryptographic practice, that is why the research of that function-classes and construction of such functions have a great importance. This study focuses on some types of functions having special characteristics in the class of highly nonlinear odd-dimensional Boolean-functions. Upper bound can be given for the number of non-zero linear structures of such functions and regarding them as mappings some functional-relations can be proved. From the results one can gain two algorithms. By the help of the first one special highly nonlinear odd dimensional Boolean-functions can be constructed by using functions having the same characteristics, the second one renders possible the construction of bent functions of a one-level higher dimension by the use of special highly nonlinear odd-dimensional Boolean-functions. The paper shows a relation between bent functions in even dimensional Boolean-space and odd dimensional highly nonlinear Boolean functions.     

On the divergence of a certain series

We investigate for which real numbers α the series (4) converges, and prove that, even though it converges almost everywhere in the sense of Lebesgue to a periodic, with a period 1, odd function in L₂([0,1]), it is divergent at uncountably many points, the set of which is dense in [0,1]. Finally, we find the Fourier expansion of the function defined by the series (4).     

Solution of the wave equation in Rn + 1 with data on a characteristic cone

A unified treatment of the problem is presented for both odd and even space dimensions. In contrast to previous results for odd n, when the space dimension is even, there is no general existence although the uniqueness holds. A necessary and sufficient condition for admissible data is given. Of independent interest are several versions of the “Plancherel theorem” of the Radon transform, in the space L₂¹(Rⁿ) of all functions whose gradients are square integrable.     

The odd–even invariant for graphs

The odd–even invariant for graphs is the graphic version of the odd–even invariant for oriented matroids. Here, simple properties of this invariant are verified, and for certain graphs, including chordal graphs and complete bipartite graphs, its value is determined. The odd–even chromatic polynomial is introduced, its coefficients are briefly studied, and it is shown that the absolute value of this polynomial at −1 equals the odd–even invariant, in analogy with the usual chromatic polynomial and the number of acyclic orientations.     

Generalized Maiorana–McFarland class and normality of p-ary bent functions

A class of bent functions which contains bent functions with various properties like regular, weakly regular and not weakly regular bent functions in even and in odd dimension, is analyzed. It is shown that this class includes the Maiorana–McFarland class as a special case. Known classes and examples of bent functions in odd characteristic are examined for their relation to this class. In the second part, normality for bent functions in odd characteristic is analyzed. It turns out that differently to Boolean bent functions, many – also quadratic – bent functions in odd characteristic and even dimension are not normal. It is shown that regular Coulter–Matthews bent functions are normal.     

Even and odd holes in cap‐free graphs

It is an old problem in graph theory to test whether a graph contains a chordless cycle of length greater than three (hole) with a specific parity (even, odd). Studying the structure of graphs without odd holes has obvious implications for Berge's strong perfect graph conjecture that states that a graph G is perfect if and only if neither G nor its complement contain an odd hole. Markossian, Gasparian, and Reed have proven that if neither G nor its complement contain an even hole, then G is β‐perfect. In this article, we extend the problem of testing whether G(V, E) contains a hole of a given parity to the case where each edge of G has a label odd or even. A subset of E is odd (resp. even) if it contains an odd (resp. even) number of odd edges. Graphs for which there exists a signing (i.e., a partition of E into odd and even edges) that makes every triangle odd and every hole even are called even‐signable. Graphs that can be signed so that every triangle is odd and every triangle is odd and every hole is odd are called odd‐signable. We derive from a theorem due to Truemper co‐NP characterizations of even‐signable and odd‐signable graphs. A graph is strongly even‐signable if it can be signed so that every cycle of length ≥ 4 with at most one chord is even and every triangle is odd. Clearly a strongly even‐signable graph is even‐signable as well. Graphs that can be signed so that cycles of length four with one chord are even and all other cycles with at most one chord are odd are called strongly odd‐signable. Every strongly odd‐signable graph is odd‐signable. We give co‐NP characterizations for both strongly even‐signable and strongly odd‐signable graphs. A cap is a hole together with a node, which is adjacent to exactly two adjacent nodes on the hole. We derive a decomposition theorem for graphs that contain no cap as induced subgraph (cap‐free graphs). Our theorem is analogous to the decomposition theorem of Burlet and Fonlupt for Meyniel graphs, a well‐studied subclass of cap‐free graphs. If a graph is strongly even‐signable or strongly odd‐signable, then it is cap‐free. In fact, strongly even‐signable graphs are those cap‐free graphs that are even‐signable. From our decomposition theorem, we derive decomposition results for strongly odd‐signable and strongly even‐signable graphs. These results lead to polynomial recognition algorithms for testing whether a graph belongs to one of these classes. © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 289–308, 1999     

On a bilateral birth-death process with alternating rates

We consider a bilateral birth-death process characterized by a constant transition rate ?? from even states and a possibly different transition rate??? from odd states. We determine the probability generating functions of the even and odd states, the transition probabilities, mean and variance of the process for arbitrary initial state. Some features of the birth-death process confined to the non-negative integers by a reflecting boundary in the zero-state are also analyzed. In particular, making use of a Laplace transform approach we obtain a series form of the transition probability from state 1 to the zero-state.     

Classification of harish-chandra modules over the super-virasoro algebras

In this paper, we first construct all indecomposable modules whose dimensions of weight spaces of the even and odd parts are ≤ 1, then classify all Harish-Chandra module over the super-Virasoro algebras, proving that every Harish-Chandra module over the super-Virasoro algebras is either a highest or lowest weight module, or else a module of the intermediate series. This result generalizes a theorem which was originally given as a conjecture by Kac on the Virasoro algebra.     

Approximate inversion of the 3 D radon transform

The nuclear magnetic resonance (NMR) zeugmatography, a new technology in diagnostic medicine, leads to the problem of inverting the Radon transform in three dimensions. In contrast to even dimensions in odd dimensions the inversion formula is local. In three dimensions it consists of a backprojection operator, which brings no problems for the implementation, and taking the second derivative of the data. This is usually approximated by the central difference quotient. Here the effect of this approximate inversion operator is studied, error estimates for this ill-posed problem are given and a stepsize is computed which minimizes the sum of discretization and data error.     

An integral transform generating elementary functions in Clifford analysis

In this paper we introduce a real integral transform which links trigonometric and Bessel functions. This allows us to construct a monogenic pseudo‐exponential in Clifford analysis. There is a deep difference between odd and even dimensions. Copyright © 2006 John Wiley & Sons, Ltd.     

Bivariate Polynomial Interpolation over Nonrectangular Meshes

In this paper, by means of a new recursive algorithm of non-tensor-product-typed divided differences, bivariate polynomial interpolation schemes are constructed over nonrectangular meshes firstly, which is converted into the study of scattered data interpolation. And the schemes are different as the number of scattered data is odd and even, respectively. Secondly, the corresponding error estimation is worked out, and an equivalence is obtained between high-order non-tensor-product-typed divided differences and high-order partial derivatives in the case of odd and even interpolating nodes, respectively. Thirdly, several numerical examples illustrate the recursive algorithms valid for the non-tensor-product-typed interpolating polynomials, and disclose that these polynomials change as the order of the interpolating nodes, although the node collection is invariant. Finally, from the aspect of computational complexity, the operation count with the bivariate polynomials presented is smaller than that with radial basis functions.     

Approximation of Fejér partial sums by interpolating functions

The interpolating spline or trigonometric polynomial to a function at equally spaced points approximates the Dirichlet partial sums of its Fourier series with accuracy depending only on the neglected coefficients. We show that the Fejér mean of the Dirichlet sums can be approximated by the arithmetic mean of two Fejér trigonometric interpolants, one at the points with even indexes and one at the points with odd indexes, with an error depending only on the neglected Fourier coefficients and it is positive for positive functions. We also consider the case of Fejér spline interpolants and a constructive relation between Hermite and Fejér interpolants.     

Inverse Backscattering Problem for the Acoustic Equation in Even Dimensions

We show that the sound speedc(x) of the acoustic wave equation in any even dimension can be uniquely determined by the backscattering data provided that it is close to a constant. In the three-dimensional case, P. Stefanov and G. Uhlmann (SIAM J. Math. Anal.28,1997, 1191–1204) have proved a similar result. Their method takes advantage of the inversion formula for the Radon transform in odd dimensions being a local operator. This is not true in even dimensions. Moreover, the odd-dimensional Lax and Phillips modified Radon transform fails to work in even dimensions. In this paper, we overcome these difficulties and prove an even-dimensional version of Stefanov and Uhlmann's result.     

An overview of the fifteen puzzle using the ancient Chinese concept of pairing

The ancient Chinese mathematician Yang Hui was interested in magic squares and apparently constructed them by pair‐wise transpositions based on opposites by position—top‐bottom, left‐right, etc. The transpositions considered for solutions to the modern‐day fifteen puzzle, however, are much more restrictive; only adjacent horizontal and vertical moves are permitted. Nevertheless, we can conclude that only configurations which represent an even number of transpositions produce possible configurations in the fifteen puzzle whereas any configurations which represent an odd number of transpositions of the integers from their natural order are not possible in the fifteen puzzle.     

Graphs having circuits with at least two chords

All 2-connected non-bipartite graphs are characterized which have a minimal valency ≥3 and which have no odd circuit with two or more chords. From this it is derived that in each graph with chromatic number ≥4 containing no complete 4-graph there is an odd circuit with two or more chords. This result was conjectured by P. Erdös. Corresponding results for even circuits and for circuits with a fixed edge are obtained. Some related problems of the Turán type are solved.     

Melham's Conjecture on Odd Power Sums of Fibonacci Numbers

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at a certain Fibonacci number of odd order. We prove that this polynomial and its derivative both vanish at 1, and will be an integer polynomial after multiplying it by a product of the first consecutive Lucas numbers of odd order. This presents an a?rmative answer to a conjecture of Melham.     

Representation of Binary Quadratic Forms by a Quaternary Form

The paper presents formulas for finding the number of representations r(A; Q) of a form A with odd square-free level by the form Q defined by the identity matrix of order 4. The case where the difference of the dimensions n — m is even (the codimension is even), which was not considered previously, is analyzed. Bibliography: 8 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 302, 2003, pp. 68–80.     

A formula for the error of finite sinc interpolation with an even number of nodes

Sinc interpolation is a very efficient infinitely differentiable approximation scheme from equidistant data on the infinite line. We give a formula for the error committed when the function neither decreases rapidly nor is periodic, so that the sinc series must be truncated for practical purposes. To do so, we first complete a previous result for an odd number of points, before deriving a formula for the more involved case of an even number of points.