On Some Results Concerning the Reduite and Balayage
โ Scribed by Valentin Grecea
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 179 KB
- Volume
- 223
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In this paper, we present a series of basic theorems for transversely isotropic plates characterized by a state of bending. More precisely, we show a reciprocal theorem and a uniqueness result without positive definiteness assumptions on the elastic coefficients. Moreover, we establish
Let G be a simple graph. The achromatic number ฯ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ( k 2 ) โค m. We show that the problem of dete
DECIDABILITY AND DEFINABILITY RESULTS CONCERNING WELL-ORDERINGS AND SOME EXTENSIONS OF FIRST ORDER LOGIC by BOGDAN STANISLAW CHLEBUS in Warsaw (Poland) ## 1. Introdiirtion Let L\* denote a countable extension of the first order language L. I n this paper 1 ) definability of the class of well-order
A digraph G = (V, E) is primitive if, for some positive integer k, there is a u โ v walk of length k for every pair u, v of vertices of V . The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u โ V , denoted exp(u), is the least integer k such that there is a u โ