On the theory of infinite linear and quasilinear automata

Cybernetics ◽  
1974 ◽  
Vol 7 (4) ◽  
pp. 580-593
Author(s):  
V. P. Zarovnyi
Keyword(s):  
Infinite Linear

Explicit Solvability of Dual Pairs of Infinite Linear Programs

OPSEARCH ◽  
2005 ◽  
Vol 42 (3) ◽  
pp. 288-296
Author(s):  
K. C. Sivakumar ◽  
J. Mercy Swarna
Keyword(s):  
Linear Programs ◽  
Dual Pairs ◽  
Infinite Linear

Duality for inexact semi-infinite linear programming

Optimization ◽  
2005 ◽  
Vol 54 (1) ◽  
pp. 1-25 ◽  
Author(s):  
Juan A. Gómez † ◽  
Paul J. Bosch ‡ ◽  
Jorge Amaya
Keyword(s):  
Linear Programming ◽  
Infinite Linear Programming ◽  
Infinite Linear

Combinatorial principles weaker than Ramsey's Theorem for pairs

2007 ◽  
Vol 72 (1) ◽  
pp. 171-206 ◽  
Author(s):  
Denis R. Hirschfeldt ◽  
Richard A. Shore
Keyword(s):  
Reverse Mathematics ◽  
The Other ◽  
Base System ◽  
Ramsey's Theorem ◽  
Open Questions ◽  
Ramsey’S Theorem ◽  
Combinatorial Principles ◽  
Points Of View ◽  
The One ◽  
Infinite Linear

AbstractWe investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus in particular on the principles ADS (Ascending or Descending Sequence), which states that every infinite linear order has either an infinite descending sequence or an infinite ascending sequence, and CAC (Chain-AntiChain), which states that every infinite partial order has either an infinite chain or an infinite antichain. It is wellknown that Ramsey's Theorem for pairs () splits into a stable version () and a cohesive principle (COH). We show that the same is true of ADS and CAC, and that in their cases the stable versions are strictly weaker than the full ones (which is not known to be the case for and ). We also analyze the relationships between these principles and other systems and principles previously studied by reverse mathematics, such as WKL0, DNR, and BΣ2. We show, for instance, that WKL0 is incomparable with all of the systems we study. We also prove computability-theoretic and conservation results for them. Among these results are a strengthening of the fact, proved by Cholak, Jockusch, and Slaman, that COH is -conservative over the base system RCA0. We also prove that CAC does not imply DNR which, combined with a recent result of Hirschfeldt, Jockusch. Kjos-Hanssen, Lempp, and Slaman, shows that CAC does not imply (and so does not imply ). This answers a question of Cholak, Jockusch, and Slaman.Our proofs suggest that the essential distinction between ADS and CAC on the one hand and on the other is that the colorings needed for our analysis are in some way transitive. We formalize this intuition as the notions of transitive and semitransitive colorings and show that the existence of homogeneous sets for such colorings is equivalent to ADS and CAC, respectively. We finish with several open questions.

Algorithm for Spatial Straightness Evaluation Using Theories of Linear Complex Chebyshev Approximation and Semi-infinite Linear Programming

2005 ◽  
Vol 128 (1) ◽  
pp. 167-174 ◽  
Author(s):  
LiMin Zhu ◽  
Ye Ding ◽  
Han Ding
Keyword(s):  
Linear Programming ◽  
Chebyshev Approximation ◽  
Approximation Problem ◽  
Linear Complex ◽  
Infinite Linear Programming ◽  
Minimum Zone ◽  
Effectiveness And Efficiency ◽  
Primal And Dual ◽  
Straightness Error ◽  
Infinite Linear

This paper presents a novel methodology for evaluating spatial straightness error based on the minimum zone criterion. Spatial straightness evaluation is formulated as a linear complex Chebyshev approximation problem, and then reformulated as a semi-infinite linear programming problem. Both models for the primal and dual programs are developed. An efficient simplex-based algorithm is employed to solve the dual linear program to yield the straightness value. Also a general algebraic criterion for checking the optimality of the solution is proposed. Numerical experiments are given to verify the effectiveness and efficiency of the presented algorithm.

scholarly journals Free non-associative principal train algebras

1984 ◽  
Vol 27 (3) ◽  
pp. 313-319 ◽  
Author(s):  
P. Holgate
Keyword(s):  
Finite Number ◽  
Ground Field ◽  
Linear Forms ◽  
Infinite Dimensional ◽  
Finite Dimensional ◽  
The Senses ◽  
Special Train ◽  
Complex Coefficients ◽  
Infinite Linear

The definitions of finite dimensional baric, train, and special train algebras, and of genetic algebras in the senses of Schafer and Gonshor (which coincide when the ground field is algebraically closed, and which I call special triangular) are given in Worz-Busekros's monograph [8]. In [6] I introduced applications requiring infinite dimensional generalisations. The elements of these algebras were infinite linear forms in basis elements a0, a1,… and complex coefficients such that In this paper I consider only algebras whose elements are forms which only a finite number of the xi are non zero.

FILTERING CALCULATIONS OF WATERLOWERING IN THE CONSTRUCTION OF ENGINEERING COMMUNICATIONS

2021 ◽  
pp. 126-133
Author(s):  
N. P. KARPENKO ◽  
◽  
E. S. BEGLYAROVA ◽  
S. A. SOKOLOVA ◽  
T. I. MATVEEVA
Keyword(s):  
Administrative District ◽  
Microsoft Excel ◽  
Model Calculations ◽  
Factors Affecting ◽  
Infinite Layer ◽  
Linear Scheme ◽  
Maximum Decrease ◽  
Water Catchment ◽  
The Relationship ◽  
Infinite Linear

The purpose of the investigations is an assessment of filtration calculations of water lowering during construction works and laying engineering communications at the water catchment of the Likhoborka and Zhabenka rivers. There are considered hydrogeological questions of filtration calculations at construction and laying urban and rain sewers on the territory of the Dmitrovskoe highway in the Northern administrative district of Moscow. It is revealed that the main factors affecting hydrogeological conditions in the area of construction of engineering communications is water lowering. The dependences on the estimation of filtration calculations of water lowering in the area of construction of engineering communications are analyzed. Analytical dependences for the scheme of an infinite linear source of perturbation in the infinite layer are proposed and improved. It is established that the average costs are proportionally dependent to the level of water lowering in the water lowering area,and the relationship between average costs, regardless of the calculated linear scheme, is linear. A model for filtration calculations has been developed in Microsoft Excel. The model calculations showed that the maximum decrease in the estimated point of a multi-story non-residential administrative building does not exceed the values of the maximum allowable deformations.

scholarly journals The Owen Set And The Core Of Semi-Infinite Linear Production Situations

2000 ◽  
Author(s):  
Stef H. Tijs ◽  
Judith Timmer ◽  
Natividad Llorca ◽  
J. Sánchez Soriano
Keyword(s):  
The Core ◽  
Infinite Linear ◽  
Owen Set
Sign in / Sign up

Export Citation Format

Share Document