On positive radial entire solutions of second-order quasilinear elliptic systems

We study positive radial entire solutions of second-order quasilinear elliptic systems of the form

(∗)     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

Periodic Solution of a Nonautonomous Diffusive Food Chain System of Three Species with Time Delays

Abstract By using the continuation theorem of coincidence degree theory,the existence of a positive periodicsolution for a nonautonomous diffusive food chain system of three species. dx_1(t)/dt=x_1(t)[r_1(t)-a_(11)(t)x_1(t)-a_(12)(t)x_2(t)]+D_1(t)[y(t)-x_1(t)], dx_2(t)/dt=x_2(t)[-r_2(t)+a_(21)(t)x_1(t-r_1)-a_(22)(t)x_2(t)-a_(23)(t)x_3(t)], dx_3(t)/dt=x_3(t)[-r_3(t)+a_(32)(t)x_2(t-r_2)-a_(33)(t)x_3(t)], dy(t)/dt=y(t)[r_4(t)-a_(44)(t)y(t)]+D_2(t)[x_1(t)-y(t)]+D_2(t)[x_1(t)-y(t)],is established,where,r_i(t),a_(ii)(t)(i=1,2,3,4),D_i(t)(i=1,2),a_(12)(t),a_(21)(t),a_(23)(t)and a_(32)(t) are all positiveperiodic continuous functions with period w>0,T_i(i=1,2)are positive constants.     

On Solvability of Functional Equations Relating to Dynamical Systems with Two Generators

In this paper, some solvability problems for functional equations of the form

On the general problem of stability for impulsive differential equations

Criteria for stability, asymptotical stability and instability of the nontrivial solutions of the impulsive system

     

nvolutorial Płonka sums

The construction of the sum of a direct (semilattice ordered) system of algebras introduced by J. Plonka – later known as the Plonka sum – is one of the most important methods of composition in universal algebra, having a number of applications in different algebraic theories, such as semigroup theory, semiring theory, etc. In this paper we present a more general way for constructing algebras with involution, that is, algebraic systems equipped with a unary involutorial operation which is at the same time an antiautomorphism of the underlying algebra. It is the sum – involutorial Plonka sum, as we call it – of an involution semilattice ordered system of algebras. We investigate its basic properties, as well as the problem of its subdirect decomposition.     

On the number of -equivalent non-isomorphic models

We prove that if is consistent then is consistent with the following statement: There is for every a model of cardinality which is -equivalent to exactly non-isomorphic models of cardinality . In order to get this result we introduce ladder systems and colourings different from the ``standard' counterparts, and prove the following purely combinatorial result: For each prime number and positive integer it is consistent with that there is a ``good' ladder system having exactly pairwise nonequivalent colourings.

     

The Ergodic Theory of Traffic Jams

We introduce and analyze a simple probabilistic cellular automaton which emulates the flow of cars along a highway. Our Traffic CA captures the essential features of several more complicated algorithms, studied numerically by K. Nagel and others over the past decade as prototypes for the emergence of traffic jams. By simplifying the dynamics, we are able to identify and precisely formulate the self-organized critical evolution of our system. We focus here on the Cruise Control case, in which well-spaced cars move deterministically at maximal speed, and we obtain rigorous results for several special cases. Then we introduce a symmetry assumption that leads to a two-parameter model, described in terms of acceleration () and braking () probabilities. Based on the results of simulations, we map out the (, ) phase diagram, identifying three qualitatively distinct varieties of traffic which arise, and we derive rigorous bounds to establish the existence of a phase transition from free flow to jams. Many other results and conjectures are presented. From a mathematical perspective, Traffic CA provides local, particle-conserving, one-dimensional dynamics which cluster, and converge to a mixture of two distinct equilibria.     

QUALITATIVE THEORY OF THE KUKLES SYSTEMS:(Ⅰ) NUMBER OF CRITICAL POINTS

The special cubic system (a natural and simPlest generaIization of thequadratic system of C1ass (l) to cubic system)f.'x = yl y = --x 6y a,x' a2xy a,y' a#x' a,x'y a.xy' a,y' (1)was first studied by the Russian Mathematician I.S.KukIes [ll on the Ilecessaryand sufficient conditions fot O(0,0) to be a ccnter of (1). After [ll, the sameproblem and also the order of O as a fine fOcus were also studied iIl [2--l0] and[13-19], so (l) is now called as a "Kukles system". In l988-…     

Minimizing multi-homogeneous Bézout numbers by a local search method

Consider the multi-homogeneous homotopy continuation method for solving a system of polynomial equations. For any partition of variables, the multi-homogeneous Bézout number bounds the number of isolated solution curves one has to follow in the method. This paper presents a local search method for finding a partition of variables with minimal multi-homogeneous Bézout number. As with any other local search method, it may give a local minimum rather than the minimum over all possible homogenizations. Numerical examples show the efficiency of this local search method.