Durability of structures of polymer composites affected by static loads and climatic factors

Conclusions We suggested a model of predicting residual strength and durability of structures of CP, jointly acted upon by static loads and environmental factors, by the use of data on short-time and long-time strength obtained under laboratory conditions and of the results of residual strength in aging without load. The methods of accelerated laboratory tests devised for studying the climatic stability of PFC in aging without load cannot be quantitatively applied to the investigation of aging under load.Presented at the Sixth All-Union Conference on the Mechanics of Polymer and Composite Materials (Riga, November, 1986).Translated from Mekhanika Kompozitnykh Materialov, No. 5, pp. 915–920, September–October, 1987.     

Finding Postal Carrier Walk Paths in Mixed Graphs

The postman problem requires finding a lowest cost tour in a connected graph that traverses each edge at least once. In this paper we first give a brief survey of the literature on postman problems including, the original Chinese postman problem on undirected graphs, the windy Chinese postman problem on graphs where the cost of an arc depends on the direction the arc is transversed, the directed postman problem on graphs with directed edges, and the mixed postman problem on graphs in which there are some directed and some undirected arcs.We show how the mixed postman problem can be solved as an integer program, using the formulation of Gendreau, Laporte and Zhao, by a new row addition branch and bound algorithm, which is a modification of the column subtraction algorithm for set partitioning problems of Harche and Thompson. Computational experience shows that a slack variable heuristic is very effective in finding good solutions that are frequently optimal for these problems.     

Distribution of the roots of a quadratic congruence

The polynomial, , is considered, where , r² + . Let (f/d) be the Kronecker symbol and It is proved that Some number theoretic consequences of this result are given.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 183, pp. 155–164, 1990.     

Central Limit Theorem for a Class of Nonhomogeneous Random Walks

A spatially nonhomogeneous random walk _t on the grid =^m X ⁿ is considered. Let _t ⁰ be a random walk homogeneous in time and space, and let _t be obtained from it by changing transition probabilities on the set A= X ⁿ, || < , so that the walk remains homogeneous only with respect to the subgroup ⁿ of the group . It is shown that if >m 2 or the drift is distinct from zero, then the central limit theorem holds for _t.     

Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm

In this paper overdetermined linear equations inn unknowns are considered. Ifm is the number of equations, let _m be equipped with a smooth strictly convex norm, ·. Algorithms for finding best-fit solutions of the system which minimize the ·-error are given. The algorithms are iterative and in particular apply to the important case where _m is given thel ^p -norms, (1<p<). The algorithms consist of obtaining a least square solution i.e. carrying out an orthogonal projection at each stage of the iteration and solving a non-linear equation in a single real variable. The convergence of the algorithms are proved in the paper.     

Accessibility and Reliability for Connected Bipartite Graphs

In the recently published atlas of graphs [9] the general listing of graphs with diagrams went up to V=7 vertices but the special listing for connected bipartite graphs carried further up to V=8. In this paper we wish to study the random accessibility of these connected bipartite graphs by means of random walks on the graphs using the degree of the gratis starting point as a weighting factor. The accessibility is then related to the concept of reliability of the graphs with only edge failures. Exact expectation results for accessibility are given for any complete connected bipartite graph N₁ cbp N₂ (where cbp denotes connected bipartite) for several values of J (the number of new vertices searched for). The main conjecture in this paper is that for any complete connected bipartite graph N₁ cbp N₂: if |N₁–N₂| 1, then the graph is both uniformly optimal in reliability and optimal in random accessibility within its family. Numerical results are provided to support the conjecture.     

The Colin de Verdière number and sphere representations of a graph

Colin de Vedière introduced an interesting linear algebraic invariant (G) of graphs. He proved that (G)2 if and only ifG is outerplanar, and (G)3 if and only ifG is planar. We prove that if the complement of a graphG onn nodes is outerplanar, then (G)n–4, and if it is planar, then (G)n–5. We give a full characterization of maximal planar graphs whose complementsG have (G)=n–5. In the opposite direction we show that ifG does not have twin nodes, then (G)n–3 implies that the complement ofG is outerplanar, and (G)n–4 implies that the complement ofG is planar.Our main tools are a geometric formulation of the invariant, and constructing representations of graphs by spheres, related to the classical result of Koebe about representing planar graphs by touching disks. In particular we show that such sphere representations characterize outerplanar and planar graphs.     

Fractional integration and differentiation of variable order

I ^(x) D ^(x) . , L _p ^(x) , , (I ^(x) )^–1, (I ^(x) )^–1, , I ^(x) (L _p ).

---

---

Partly supported by the Fulbright grant during author's Visiting Professorship at the University of New Haven, Mathematics Department, West Haven, Connecticut 06516, USA, and by the Russian Foundation for Basic Research (Project 94-01-00577-a).     

Universally signable graphs

In a graph, a chordless cycle of length greater than three is called a hole. Let be a {0, 1} vector whose entries are in one-to-one correspondence with the holes of a graphG. We characterize graphs for which, for all choices of the vector , we can pick a subsetF of the edge set ofG such that |F H| H (mod 2), for all holesH ofG and |F T| 1 for all trianglesT ofG. We call these graphsuniversally signable. The subsetF of edges is said to be labelledodd. All other edges are said to be labelledeven. Clearly graphs with no holes (triangulated graphs) are universally signable with a labelling of odd on all edges, for all choices of the vector . We give a decomposition theorem which leads to a good characterization of graphs that are universally signable. This is a generalization of a theorem due to Hajnal and Surányi [3] for triangulated graphs.This work was supported in part by NSF grants DMI-9424348 DMS-9509581 and ONR grant N00014-89-J-1063. Ajai Kapoor was also supported by a grant from Gruppo Nazionale Delle Ricerche-CNR. We also acknowledge the support of Laboratoire ARTEMIS, Université Joseph Fourier, Grenoble.     

“Laplacians” on finitely ramified,graph directed fractals

A finitely ramified graph directed fractal is approximated by an adapted sequence of increasingly refined graphs. The scaling problem for a corresponding sequence of discrete Laplacians is rephrased via a renormalization map comparing two subsequent graphs. A limit set dichotomy for this map is proved: The forward orbit always accumulates at periodic points, even if the corresponding models are disconnected. Thus these periodic points can be numerically approximated by an iteration scheme based on the Schur complement. This allows to turn numerical information via the short-cut test into theorems on the existence of Laplacians on fractals.Mathematics Subject Classification (2000): 31C25, 60J45, 65N55, 47J10, 28A80Research supported by the DFG research group Spektrale Analysis, asymptotische Verteilungen und stochastische Dynamik.The author is greatful to the anonymous referees for pointing out flaws in two original definitions.     

An unconstrained convex programming view of linear programming

The major interest of this paper is to show that, at least in theory, a pair of primal and dual -optimal solutions to a general linear program in Karmarkar's standard form can be obtained by solving an unconstrained convex program. Hence unconstrained convex optimization methods are suggested to be carefully reviewed for this purpose.     

Partitioning multi-edge graphs

We introduce a new kind of graph called multi-edge graph which arises in many applications such as finite state Markov chains and broadcasting communication networks. A cluster in such a graph is a set of nodes such that for any ordered pair of nodes, there is a path of multi-edges from one to the other such that these edges remain within the same set. We give two algorithms to partition a multi-edge graph into maximal clusters. Both these algorithms are based on the depth-first search algorithm to find strongly connected components of the directed graph. We also discuss some applications of clustering in multi-edge graphs.     

Sum of sets in several dimensions

LetA, B be finite sets in ^d with|A|=m|B|=n, and assume that there is no hyperplane containing both a translation ofA and a translation ofB. Under this condition it is proved that the number of distinct vectors in the form {a+baA, bB} is at leastn+dm–d(d+1)/2. This generalizes results of Freiman (caseA=B) and Freiman, Heppes, Uhrin (caseA=–B). A more complicated estimate is also given which yields the exact bound for alln>2d.Supported by Hungarian National Foundation for Scientific Research, Grant No. 1901.     

Characteristic Classes for Difference Operators

We introduce and describe the characteristic class of a difference operator over the difference field (k((t)),). Here k is an algebraically closed field of characteristic zero and is the k-linear automorphism of k((t)) defined by (t)=t/(1+t). The approach is based on the characterization of simple difference operators in terms of their eigenvalues.     

Almost-periodic solutions for a second order abstract Cauchy problem

Summary Let M be a number field of degree m with ring of integers \bZ_M. Let F\in\bZ_M[X,Y] be a form of degree n such that F(X,1) has distinct roots. Let\break G\in\bZ[X,Y] be an arbitrary polynomial of degree k. Assuming that k\le n-2m\pl 1 if all roots of F^{(i)}(X,1) (1\le i\le n) are complex and k\le n-4m\pl 1 otherwise, we provide an efficient algorithm for finding all solutions X,Y\in\bZ_M, \max\b(\overline{|X|},\overline{|Y|}\,\b)\ki C of the inequality \overline{\b|F(X,Y)\b|\!}\,\le c \cdot \overline{\b|G(X,Y)\b|\!}\,. We provide numerical examples with m=3 and C=10^{100}.     

Mixed graph colorings

A mixed graphG contains both undirected edges and directed arcs. Ak-coloring ofG is an assignment to its vertices of integers not exceedingk (also called colors) so that the endvertices of an edge have different colors and the tail of any arc has a smaller color than its head. The chromatic number (G) of a mixed graph is the smallestk such thatG admits ak-coloring. To the best of our knowledge it is studied here for the first time. We present bounds of (G), discuss algorithms to find this quantity for trees and general graphs, and report computational experience.     

On an isomorphism problem on the closed-set lattice of a graph

Let (G) and V(G) be, respectively, the closed-set lattice and the vertex set of a graph G. Any lattice isomorphism : V(G)(G) induces a bijection : V(G)V(G) such that for each x in V(G), (x)=x' in V(G') iff ({x})={x'}. A graph G is strongly sensitive if for any graph G' and any lattice isomorphism : (G)(G), the bijection induced by is a graph isomorphism of G onto G'. In this paper we present some sufficient conditions for graphs to be strongly sensitive and prove in particular that all C ₄-free graphs and all covering graphs of finite lattices are strongly sensitive.     

Spectral parameter asymptotics of the Weyl solutions of Sturm-Liouville equations

In the paper one investigates the dependence of Weyl's solution ,)=c(,)+n()s(,) of the Sturm-Liouville equation y+q()y=²y on the spectral parameter . Under the condition that the potential q is bounded from below and q()exp(c₀+c[in1 ¦¦), it is proved for {ie217-01} for any positive values and A. If q()>1 and {ie217-02} for all >0, then in the semiplane >0 the Weyl solution (, ) is obtained from the Weyl solution (,x) is obtained from the Weyl solution e^ix with zero potential, with the aid of a generalization of B. Ya Levin's transformation operators.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 170, pp. 184–206, 1989.I express my sincere gratitude to L. A. Pastur and I. V. Ostrovskii for valuable advice and discussions.     

On an application of infinitely divisible distributions to quadrature problems

— - , .     

Conservative weightings and ear-decompositions of graphs

A subsetJ of edges of a connected undirected graphG=(V, E) is called ajoin if |CJ||C|/2 for every circuitC ofG. Answering a question of P. Solé and Th. Zaslavsky, we derive a min-max formula for the maximum cardinality of a joint ofG. Namely, =(+|V|–1)/2 where denotes the minimum number of edges whose contraction leaves a factor-critical graph.To study these parameters we introduce a new decomposition ofG, interesting for its own sake, whose building blocks are factor-critical graphs and matching-covered bipartite graphs. We prove that the length of such a decomposition is always and show how an optimal join can be constructed as the union of perfect matchings in the building blocks. The proof relies on the Gallai-Edmonds structure theorem and gives rise to a polynomial time algorithm to construct the optima in question.