On the theta number of powers of cycle graphs

We give a closed formula for Lovász’s theta number of the powers of cycle graphs C _k ^d?1 and of their complements, the circular complete graphs K _k/d . As a consequence, we establish that the circular chromatic number of a circular perfect graph is computable in polynomial time. We also derive an asymptotic estimate for the theta number of C _k ^d .     

p-Adic invariant summation of some p-adic functional series

We consider summation of some finite and infinite functional p-adic series with factorials. In particular, we are interested in the infinite series which are convergent for all primes p, and have the same integer value for an integer argument. In this paper, we present rather large class of such p-adic functional series with integer coefficients which contain factorials. By recurrence relations, we constructed sequence of polynomials A _k (n; x) which are a generator for a few other sequences also relevant to some problems in number theory and combinatorics.     

A recursive formula for even order harmonic series

A useful recursive formula for obtaining the infinite sums of even order harmonic series Σ^∞_n=1 (1/n^2k), k = 1, 2, …, is derived by an application of Fourier series expansion of some periodic functions. Since the formula does not contain the Bernoulli numbers, infinite sums of even order harmonic series may be calculated by the formula without the Bernoulli numbers. Infinite sums of a few even order harmonic series, which are calculated using the recursive formula, are tabulated for easy reference.     

Involutions of Type G<Subscript>2</Subscript> Over Fields of Characteristic Two

We continue a study of automorphisms of order 2 of algebraic groups. In particular we look at groups of type G₂ over fields k of characteristic two. Let C be an octonion algebra over k; then Aut(C) is a group of type G₂ over k. We characterize automorphisms of order 2 and their corresponding fixed point groups for Aut(C) by establishing a connection between the structure of certain four dimensional subalgebras of C and the elements in Aut(C) that induce inner automorphisms of order 2. These automorphisms relate to certain quadratic forms which, in turn, determine the Galois cohomology of the fixed point groups of the involutions. The characteristic two case is unique because of the existence of four dimensional totally singular subalgebras. Over finite fields we show how our results coincide with known results, and we establish a classification of automorphisms of order 2 over infinite fields of characteristic two.     

Solving Non-Homogeneous Nested Recursions Using Trees

The solutions to certain nested recursions, such as Conolly’s C(n) = C(n?C(n?1)) + C(n?1?C(n?2)), with initial conditions C(1) = 1, C(2) = 2, have a well-established combinatorial interpretation in terms of counting leaves in an infinite binary tree. This tree-based interpretation, and its generalization to a similar k-term nested recursion, only apply to homogeneous recursions and only solve each recursion for one set of initial conditions determined by the tree. In this paper, we extend the tree-based interpretation to solve a non-homogeneous version of the k-term recursion that includes a constant term. To do so we introduce a tree-grafting methodology that inserts copies of a finite tree into the infinite k-ary tree associated with the solution of the corresponding homogeneous k-term recursion. This technique also solves the given non-homogeneous recursion with various sets of initial conditions.     

A note on ∣A∣k summability factors of infinite series

In this note we give an improvement to a recent result obtained by Savas and Rhoade concerning ∣A∣_k summability of infinite series.     

CFD of turbulent transport of particles behind a backward-facing step using a new model—k-ε-Sp

The k-ε-S_p model, describing two-dimensional gas–solid two-phase turbulent flow, has been developed. In this model, the diffusion flux and slip velocity of solid particles are introduced to represent the particle motion in two-phase flow. Based on this model, the gas–solid two-phase turbulent flow behind a vertical backward-facing step is simulated numerically and the turbulent transport velocities of solid particles with high density behind the step are predicted. The numerical simulation is validated by comparing the results of the numerical calculation with two other two-phase turbulent flow models (k-ε-A_p, k-ε-k_p) by Laslandes and the experimental measurements. This model, not only has the same virtues of predicting the longitudinal transport of the solid particles as the present practical two-phase flow models, but also can predict the lateral transport of the solid particles correctly.     

The visually distinct configurations of k sets

Two sets of sets, C₀ and C₁, are said to be visually equivalent if there is a 1-1 mapping m from C₀ onto C₁ such that for every S, T?C₀, S ∩ T=0 if and only if m(S)∩ m(T)=0 and S?T if and only if m(S)?m(T). We find estimates for V(k), the number of equivalence classes of this relation on sets of k sets, for finite and infinite k. Our main results are that for finite k, $\text{1}\text{2}\text{k}{}^2\text{-k log k <log V (k)<ak}{}^2\text{+βk+log k}$, where α and β are approximately 0.7255 and 2.5323 respectively, and there is a set N of cardinality $\text{1}\text{2}\text{(k}{}^2\text{+k)}$ such that there are V(k) visually distinct sets of k subsets of N.     

Пространства Lp со сме шанной нормой на беск онечном декартовом произвед ении вероятностных п ространств

Letp=(p ₁,p₂,...) be a vector with an infinite number of coordinates, 1≦p _k≦,k=1,2,... On the set of random functions depending on infinite number of variables, a mixed norm ∥.∥ _p is introduced, and thus the spacesL _p with mixed norm are defined. Part 1 contains observations of general properties of those spaces (in particular, convergence properties depending on the behaviour of the exponentsp _k ask→ ∞). Part 2 contains the proof of infinite-dimensional version of S. L. Sobolev's theorem (in mixed norm) for potentials of Wiener semigroup on infinite dimensional torusT ^∞.     

Non-cover generalized Mycielski, Kneser, and Schrijver graphs

A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. We prove that the generalized Mycielski graphs M_m(C_2t+1) of an odd cycle, Kneser graphs KG(n,k), and Schrijver graphs SG(n,k) are not cover graphs when m?0,t?1, k?1, and n?2k+2. These results have consequences in circular chromatic number.     

Graphs with maximum size and lower bounded girth

For integers n≥4 and ν≥n+1, let ex(ν;{C₃,…,C_n}) denote the maximum number of edges in a graph of order ν and girth at least n+1. The {C₃,…,C_n}-free graphs with order ν and size ex(ν;{C₃,…,C_n}) are called extremal graphs and denoted by EX(ν;{C₃,…,C_n}). We prove that given an integer k≥0, for each n≥2log₂(k+2) there exist extremal graphs with ν vertices, ν+k edges and minimum degree 1 or 2. Considering this idea we construct four infinite families of extremal graphs. We also see that minimal (r;g)-cages are the exclusive elements in EX(ν₀(r,g);{C₃,…,C_g−1}).     

Differential calculus over general base fields and rings

We present an axiomatic approach to finite- and infinite-dimensional differential calculus over arbitrary infinite fields (and, more generally, suitable rings). The corresponding basic theory of manifolds and Lie groups is developed. Special attention is paid to the case of mappings between topological vector spaces over non-discrete topological fields, in particular ultrametric fields or the fields of real and complex numbers. In the latter case, a theory of differentiable mappings between general, not necessarily locally convex spaces is obtained, which in the locally convex case is equivalent to Keller's C^k_c-theory.     

A generalization of Fan’s results: Distribution of cycle lengths in graphs

Fan [G. Fan, Distribution of cycle lengths in graphs, J. Combin. Theory Ser. B 84 (2002) 187-202] proved that if G is a graph with minimum degree δ(G)≥3k for any positive integer k, then G contains k+1 cycles C₀,C₁,…,C_k such that k+1<|E(C₀)|<|E(C₁)|<?<|E(C_k)|, |E(C_i)−E(C_i−1)|=2, 1≤i≤k−1, and 1≤|E(C_k)|−|E(C_k−1)|≤2, and furthermore, if δ(G)≥3k+1, then |E(C_k)|−|E(C_k−1)|=2. In this paper, we generalize Fan’s result, and show that if we let G be a graph with minimum degree δ(G)≥3, for any positive integer k (if k≥2, then δ(G)≥4), if d_G(u)+d_G(v)≥6k−1 for every pair of adjacent vertices u,v∈V(G), then G contains k+1 cycles C₀,C₁,…,C_k such that k+1<|E(C₀)|<|E(C₁)|<?<|E(C_k)|, |E(C_i)−E(C_i−1)|=2, 1≤i≤k−1, and 1≤|E(C_k)|−|E(C_k−1)|≤2, and furthermore, if d_G(u)+d_G(v)≥6k+1, then |E(C_k)|−|E(C_k−1)|=2.     

A study on weighted mean summability

In the present paper, a general theorem on summability factors of infinite series has been proved. Also we have obtained a new result concerning the |C,1;δ| _k summability factors.     

Dual-phase-lag thermoelastic damping models for micro/nanobeam resonators

Thermoelastic damping (TED) affects the quality factors of vacuum-operated micro/nanobeam resonators significantly. In this work, by adopting the non-Fourier theory of dual-phase-lag (DPL) model, an analytical formula of TED in micro/nanobeam resonators with circular cross-section is first developed. Moreover, for micro/nanobeam resonators with rectangular cross-section, the series-form type of DPL-TED model is also proposed and compared with the modified existing model. The characteristics of TED spectra with the single-peak, dual-peak, and multiple-peak phenomena are explored. The simulation results reveal that the ratio of dual-phase-lag times and the characteristic dimension of beams such as the radius and thickness have significant influences on TED behaviors. In addition, temperature distributions in micro/nanobeams exhibit an apparent distinction under the DPL non-Fourier effect.     

Stability of command economies

We consider the impact of fluctuations in the technology matrix A on two command input- output models. In the first, resources and goals are fixed and the model is solved for industrial production. If the growth rate can be zero, expected values of fluctuations of industrial goods are infinite. In the second, produced goods are scaled down to fit resources. Here we derive a criterion that

$\text{2log n}\text{k}$

should be small, where k is the number of significant ingredients in a good efficiency of aggregated economies, with n replaced by n₁/2 where n₁ is the number of goods aggregated into one.     

Solving Ck/Cm/1/N queues by using characteristic roots in matrix analytic methods

In this paper, we study a C_k/C_m/1/N open queueing system with finite capacity. We investigate the property which shows that a product of the Laplace Stieltjes Transforms of interarrival and service times distributions satisfies an equation of a simple form. According to this equation, we present that the stationary probabilities on the unboundary states can be written as a linear combination of vector product-forms. Each component of these products is expressed in terms of roots of an associated characteristic polynomial. As a result, we carry out an algorithm for solving stationary probabilities in C_k/C_m/1/N systems, which is independent of N, hence greatly reducing the computational complexity.     

On a conjecture of Erdős and Simonovits: Even cycles

Let F be a family of graphs. A graph is F-free if it contains no copy of a graph in F as a subgraph. A cornerstone of extremal graph theory is the study of the Turán number ex(n,F), the maximum number of edges in an F-free graph on n vertices. Define the Zarankiewicz number z(n,F) to be the maximum number of edges in an F-free bipartite graph on n vertices. Let C _k denote a cycle of length k, and let C _k denote the set of cycles C _?, where 3≤?≤k and ? and k have the same parity. Erd?s and Simonovits conjectured that for any family F consisting of bipartite graphs there exists an odd integer k such that ex(n,F ∪ C _k ) ～ z(n,F) — here we write f(n) ～ g(n) for functions f,g: ? → ? if lim _n→∞ f(n)/g(n)=1. They proved this when F ={C ₄} by showing that ex(n,{C ₄;C ₅})～z(n,C ₄). In this paper, we extend this result by showing that if ?∈{2,3,5} and k>2? is odd, then ex(n,C _2? ∪{C _k }) ～ z(n,C _2? ). Furthermore, if k>2?+2 is odd, then for infinitely many n we show that the extremal C _2? ∪{C _k }-free graphs are bipartite incidence graphs of generalized polygons. We observe that this exact result does not hold for any odd k<2?, and furthermore the asymptotic result does not hold when (?,k) is (3, 3), (5, 3) or (5, 5). Our proofs make use of pseudorandomness properties of nearly extremal graphs that are of independent interest.     

A study on absolute Riesz summability factors

In the present paper, two general theorems on summability factors of infinite series which generalize some known results, have been proved. Also we have obtained two new results concerning the |C,1;δ| _k summability factors.     

Application of Hankel transforms to boundary value problems of water flow due to a circular source

With the aid of Hankel transform technique, we obtain close-form solutions for discontinuous boundary-condition problems of water flow due to a circular source, which located on the upper surface of a confined aquifer. Owing to difficult evaluations of the original solutions that are in a form of an infinite range integral with a singular point and Bessel functions in integrands, we adopt two numerical algorisms to transform the original solutions as a series form for convenient practical applications. We apply the solutions in series form to numerical examples to analyze the characteristics of the flow in the confined aquifers subjected to pumping or recharge. By numerical examples, it indicates that: the drawdown will reduce with the increase of the layer thickness and the distance from the center of a circular source when pumping in a region with a finite thickness and a finite width; two algorisms for closed-form solutions of an infinite range integral have almost the same results, but the second algorism is superior for a faster convergence; in a semi-infinite confined aquifer, the drawdown due to a constant pumping rate Q and uplift due to recharge by a given hydraulic head s₀ will both decrease with the increase of K_r/K_v; however, the radius r₀ of the circular source has a reverse influence on the drawdown and the uplift, i.e., the drawdown decrease with the increase of r₀, while the uplift increase with r₀.