Φ-entropy inequality and application for SDEs with jumps

By using the Φ-entropy inequality derived in [16] and [2] for Poisson measures, the same type of inequality is established for a class of stochastic differential equations driven by purely jump Lévy processes. This inequality implies the exponential convergence in Φ-entropy of the associated Markov semigroup. The semigroup Φ-entropy inequality for SDEs driven by Poisson point processes is also considered.     

A preemptive discrete-time priority buffer system with partial buffer sharing

This paper considers a Geo/Geo/1 discrete-time queue with preemptive priority. Both the arrival and service processes are Bernoulli processes. There are two kinds of customers: low-priority and high-priority customers. The high-priority customers have a preemptive priority over low-priority customers. If the total number of customers is equal or more than the threshold (k), the arrival of low-priority customers will be ignored. Hence the system buffer size is finite only for the low-priority customers. A recursive numerical procedure is developed to find the steady-state probabilities. With the aid of recursive equations, we transform the infinite steady-state departure-epoch equations set to a set of (k + 1) × (k + 2)/2 linear equations set based on the embedded Markov Chain technique. Then, this reduced linear equations set is used to compute the steady-state departure-epoch probabilities. The important performance measures of the system are calculated. Finally, the applicability of the solution procedure is shown by a numerical example and the sensitivity of the performance measures to the changes in system parameters is analyzed.     

The Rank of Abelian Varieties over Infinite Galois Extensions

G. Frey and M. Jarden (1974, Proc. London Math. Soc.28, 112-128) asked if every Abelian variety A defined over a number field k with dim A>0 has infinite rank over the maximal Abelian extension k^ab of k. We verify this for the Jacobians of cyclic covers of P¹, with no hypothesis on the Weierstrass points or on the base field. We also derive an infinite rank criterion by analyzing the ramification of division points of an Abelian variety. As an application, we show that any d -dimensional Abelian variety A over k with a degree n projective embedding over k has infinite rank over the compositum of all extensions of k of degree <n(4d+2).     

Facets of the <Emphasis Type="Italic">r</Emphasis>-Stable (<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">k</Emphasis>)-Hypersimplex

Let k, n, and r be positive integers with k < n and \({r \leq \lfloor \frac{n}{k} \rfloor}\). We determine the facets of the r-stable n, k-hypersimplex. As a result, it turns out that the r-stable n, k-hypersimplex has exactly 2n facets for every \({r < \lfloor \frac{n}{k} \rfloor}\). We then utilize the equations of the facets to study when the r-stable hypersimplex is Gorenstein. For every k > 0 we identify an infinite collection of Gorenstein r-stable hypersimplices, consequently expanding the collection of r-stable hypersimplices known to have unimodal Ehrhart \({\delta}\)-vectors.     

Φ-Harmonic functions on discrete groups and the first ℓΦ-cohomology

We study the first cohomology groups of a countable discrete group G with coefficients in a G-module ?^Φ(G), where Φ is an N-function of class Δ₂(0) ∩ ?₂(0). Developing the ideas of Puls and Martin-Valette for a finitely generated group G, we introduce the discrete Φ-Laplacian and prove a theorem on the decomposition of the space of Φ-Dirichlet finite functions into the direct sum of the spaces of Φ-harmonic functions and ?^Φ(G) (with an appropriate factorization). We prove also that if a finitely generated group G has a finitely generated infinite amenable subgroup with infinite centralizer then \(\bar H^1\) (G, ?^Φ(G)) = 0. In conclusion, we show the triviality of the first cohomology group for the wreath product of two groups one of which is nonamenable.     

Orientations of infinite graphs with prescribed edge-connectivity

We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity). Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989.     

A remark on the capitulation problem

We determine explicitly an infinite family of imaginary cyclic number fields k, such that the 2-class group of k is elementary with arbitrary large 2-rank and capitulates in an unramified quadratic extension K. The infinitely many number fields k and K have the same Hilbert 2-class field and an infinite Hilbert 2-class field tower.     

On the independence of Heegner points in the function field case

Let ∞ be a fixed place of a global function field k. Let E be an elliptic curve defined over k which has split multiplicative reduction at ∞ and fix a modular parametrization ΦE:X₀(N)→E. Let be Heegner points associated to the rings of integers of distinct quadratic “imaginary” fields K₁,…,Kr over (k,∞). We prove that if the “prime-to-2p” part of the ideal class numbers of ring of integers of K₁,…,Kr are larger than a constant C=C(E,ΦE) depending only on E and ΦE, then the points P₁,…,Pr are independent in . Moreover, when k is rational, we show that there are infinitely many imaginary quadratic fields for which the prime-to-2p part of the class numbers are larger than C.     

Reduced limits for nonlinear equations with measures

We consider equations (E) −Δu+g(u)=μ in smooth bounded domains Ω⊂RN, where g is a continuous nondecreasing function and μ is a finite measure in Ω. Given a bounded sequence of measures (μk), assume that for each k?1 there exists a solution uk of (E) with datum μk and zero boundary data. We show that if uk→u# in L¹(Ω), then u# is a solution of (E) relative to some finite measure μ#. We call μ# the reduced limit of (μk). This reduced limit has the remarkable property that it does not depend on the boundary data, but only on (μk) and on g. For power nonlinearities g(t)=|t|^q−1t, ∀t∈R, we show that if (μk) is nonnegative and bounded in W−2,q(Ω), then μ and μ# are absolutely continuous with respect to each other; we then produce an example where μ#≠μ.     

Bound states of a two-boson system on a two-dimensional lattice

We consider a Hamiltonian of a two-boson system on a two-dimensional lattice Z². The Schrödinger operator H(k₁, k₂) of the system for k₁ = k₂ = π, where k = (k₁, k₂) is the total quasimomentum, has an infinite number of eigenvalues. In the case of a special potential, one eigenvalue is simple, another one is double, and the other eigenvalues have multiplicity three. We prove that the double eigenvalue of H(π,π) splits into two nondegenerate eigenvalues of H(π, π ? 2β) for small β > 0 and the eigenvalues of multiplicity three similarly split into three different nondegenerate eigenvalues. We obtain asymptotic formulas with the accuracy of β² and also an explicit form of the eigenfunctions of H(π, π ?2β) for these eigenvalues.     

Isolated singularities for some types of curvature equations

We consider the removability of isolated singularities for the curvature equations of the form H_k[u]=0, which is determined by the kth elementary symmetric function, in an n-dimensional domain. We prove that, for 1?k?n−1, isolated singularities of any viscosity solutions to the curvature equations are always removable, provided the solution can be extended continuously at the singularities. We also consider the class of “generalized solutions” and prove the removability of isolated singularities.     

Stability of nonautonomous differential equations in Hilbert spaces

We introduce a large class of nonautonomous linear differential equations v^′=A(t)v in Hilbert spaces, for which the asymptotic stability of the zero solution, with all Lyapunov exponents of the linear equation negative, persists in v^′=A(t)v+f(t,v) under sufficiently small perturbations f. This class of equations, which we call Lyapunov regular, is introduced here inspired in the classical regularity theory of Lyapunov developed for finite-dimensional spaces, that is nowadays apparently overlooked in the theory of differential equations. Our study is based on a detailed analysis of the Lyapunov exponents. Essentially, the equation v^′=A(t)v is Lyapunov regular if for every k the limit of Γ(t)^1/t as t→∞ exists, where Γ(t) is any k-volume defined by solutions v₁(t),…,v_k(t). We note that the class of Lyapunov regular linear equations is much larger than the class of uniformly asymptotically stable equations.     

On injective Jordan semi-triple maps of matrix algebras

We show that every injective Jordan semi-triple map on the algebra M_n(F) of all n × n matrices with entries in a field F (i.e. a map Φ:M_n(F)→M_n(F) satisfying

Φ(ABA)=Φ(A)Φ(B)Φ(A)     

A general class of fuzzy operators,the demorgan class of fuzzy operators and fuzziness measures induced by fuzzy operators

In this paper we examine operators which can be derived from the general solution of functional equations on associativity. We define the characteristics of those functions f(x) which are necessary for the production of operators. We shall show, that with the help of the negation operator for every such function f(x) a function g(x) can be given, from which a disjunctive operator can be derived, and for the three operators the DeMorgan identity is fulfilled. For the fulfillment of the DeMorgan identity the necessary and sufficient conditions are given.We shall also show that an f_λ(x) can be constructed for every f(x), so that for the derived k_λ(x,y) and d_λ(x,y) lim_λ→∞k_λ(x,y) and lim_λ→∞d_λ(x,y) = max(x,y).As Yager's operator is not reducible, for every λ there exists an α, for which, in case x < α and y<α, k_λ(x,y) = 0.We shall give an f(x) which has the characteristics of Yager's operator, and which is strictly monotone.Finally we shall show, that with the help of all those f(x), which are necessary when constructing a k(x,y), an F(x) can be constructed which has the properties of the measures of fuzziness introduced by A. De Luca and S. Termini. Some classical fuzziness measures are obtained as special cases of our system.     

The construction of infinite families of any κ-tight optimal and singular κ-tight optimal directed double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems. Given the number n of nodes, how to construct a DLN which has minimum diameter? This problem has attracted great attention. A related and longtime unsolved problem is for any given non-negative integer k, is there an infinite family of k-tight optimal DLN? In this paper, two main results are obtained (1) for any k ≥ 0, the infinite families of k-tight optimal DLN can be constructed, where the number n(k,e,c) of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c. (2) for any k ≥ 0,an infinite family of singular k-tight optimal DLN can be constructed.     

On the order of magnitude of Fourier coefficients with respect to uniformly bounded orthonormal systems

пУсть {Φ _k (x) ∶k>0} — РАВНО МЕРНО ОгРАНИЧЕННАь ОРтОНОРМИРОВАННАь с ИстЕМА НА пРОстРАНстВЕX с кО НЕЧНОИ пОлОжИтЕльНО И МЕРОИ. Дль ФУНкцИИf ?L ^p (X) Дль НЕкОтОРОгО 1≤p≤2 ВВОДИМ ЕЕ кОЁФФИцИЕН ты ФУРьЕc _k (f) пО сИстЕМЕΦ _k (x). Дль жАДАННОгОα>0 М ы РАссМАтРИВАЕМ пОслЕДОВАтЕльНОсть {λ _k ^α :k ≥ 0} пОлОжИтЕльНых ЧИсЕл тАкИх, ЧтО т.Е. тАкИх, ЧтО гДЕA _n ^α — тАк НАжыВАЕМыЕ ЧИслА ЧЕжАРО. Мы ИжУЧАЕМ ЁтУ жАДАЧУ Дль ДВОИНых ОРтОгОНА льНых сИстЕМ, А тАкжЕ Дль НЕпРЕРыВНых ФУНкцИИ. пРИ ДОкАжАтЕльстВЕ М ы кОМБИНИРУЕМ МЕтОДы т ЕОРИИ сУММИРОВАНИь И ФУНкцИОНАльНОгО АН АлИжА.     

The capture time of a graph

We consider the game of Cops and Robbers played on finite and countably infinite connected graphs. The length of games is considered on cop-win graphs, leading to a new parameter, the capture time of a graph. While the capture time of a cop-win graph on n vertices is bounded above by n−3, half the number of vertices is sufficient for a large class of graphs including chordal graphs. Examples are given of cop-win graphs which have unique corners and have capture time within a small additive constant of the number of vertices. We consider the ratio of the capture time to the number of vertices, and extend this notion of capture time density to infinite graphs. For the infinite random graph, the capture time density can be any real number in [0,1]. We also consider the capture time when more than one cop is required to win. While the capture time can be calculated by a polynomial algorithm if the number k of cops is fixed, it is NP-complete to decide whether k cops can capture the robber in no more than t moves for every fixed t.     

Solving Equations of Free Vibration for a Cylindrical Shell Rotating on Rollers by the Fourier Method

The small free vibrations of an infinite circular cylindrical shell rotating about its axis at a constant angular velocity are considered. The shell is supported on n absolutely rigid cylindrical rollers equispaced on its circle. The roller-supported shell is a model of an ore benefication centrifugal concentrator with a floating bed. The set of linear differential equations of vibrations is sought in the form of a truncated Fourier series containing N terms along the circumferential coordinate. A system of 2N–n linear homogeneous algebraic equations with 2N–n unknowns is derived for the approximate estimation of vibration frequencies and mode shapes. The frequencies ω _k , k = 1, 2, …, 2N–n, are positive roots of the (2N–n)th-order algebraic equation D(ω²) = 0, where D is the determinant of this set. It is shown that the system of 2N–n equations is equivalent to several independent systems with a smaller number of unknowns. As a consequence, the (2N–n)th-order determinant D can be written as a product of lower-order determinants. In particular, the frequencies at N = n are the roots of algebraic equations of an order is lower than 2 and can be found in an explicit form. Some frequency estimation algorithms have been developed for the case of N > n. When N increases, the number of found frequencies also grows, and the frequencies determined at N = n are refined. However, in most cases, the vibration frequencies can not be found for N > n in an explicit form.     

Chaotic vibrations of flexible infinite length cylindrical panels using the Kirchhoff–Love model

Treated as continuous deformable systems with an infinite number of degrees of freedom, flexible infinite length cylindrical panels subject to harmonic load are studied. Using the finite difference method with respect to spatial coordinates, the continuous system is reduced to lumped one governed by ordinary differential equations. These equations are transformed to a normal form and then solved numerically using the fourth order Runge–Kutta method. In order to trace and explain vibrational behaviour, dependencies w_max(q₀) and Lyapunov exponents are calculated for panels with parameter value k_x = 48. The corresponding charts of the control parameters {q₀, ω_q} are also reported. Novel scenarios yielding chaotic dynamics exhibited by cylindrical panels are illustrated and discussed.     

Convergence and relative compactness in distribution of sequences of random hypermeasures

Let Φ be a compact set in a vector space equipped with a convergence which is metrizable in Φ but not certainly in the whole space. We endow the space of continuous on Φ linear functionals on span Φ with the norm \( {\left\| u \right\|_\Phi } = \sup \varphi \in \Phi \left| {u\varphi } \right| \) and call the elements of the completion of Φ hypermeasures. We prove theorems on the convergence in probability or in distribution and relative compactness in distribution of a sequence of random hypermeasures.