Some Combinatorial Principles for Solving Algebraic Problems

2000 ◽  
pp. 107-127
Author(s):  
Rüdiger Göbel
Keyword(s):  
Combinatorial Principles

scholarly journals Filling cages. Reverse mathematics and combinatorial principles

2020 ◽  
Vol 26 (3-4) ◽  
pp. 300-300
Author(s):  
Marta Fiori Carones
Keyword(s):  
Reverse Mathematics ◽  
Combinatorial Principles

scholarly journals Teaching Combinatorial Principles Using Relations through the Placemat Method

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1825
Author(s):  
Viliam Ďuriš ◽  
Gabriela Pavlovičová ◽  
Dalibor Gonda ◽  
Anna Tirpáková
Keyword(s):  
Graph Theory ◽  
Complexity Theory ◽  
Slovak Republic ◽  
Teaching Mathematics ◽  
Combinatorial Structures ◽  
Algorithmic Approach ◽  
Scientific Disciplines ◽  
Combinatorial Principles ◽  
The Subject ◽  
As Graph

The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific disciplines such as graph theory and complexity theory. It is important in solving many practical tasks that require the compilation of an object with certain properties, proves the existence or non-existence of some properties, or specifies the number of objects of certain properties. This paper examines the basic combinatorial structures and presents their use and learning using relations through the Placemat method in teaching process. The effectiveness of the presented innovative way of teaching combinatorics was also verified experimentally at a selected high school in the Slovak Republic. Our experiment has confirmed that teaching combinatorics through relationships among talented children in mathematics is more effective than teaching by a standard algorithmic approach.

Constructible lattices of c-degrees

1982 ◽  
Vol 47 (4) ◽  
pp. 739-754
Author(s):  
C.P. Farrington
Keyword(s):  
Set Theory ◽  
Regular Cardinal ◽  
Boolean Algebras ◽  
Combinatorial Complexity ◽  
Generic Extension ◽  
Transitive Model ◽  
Perfect Set ◽  
Consistency Results ◽  
Combinatorial Principles ◽  
Souslin Trees

This paper is devoted to the proof of the following theorem.Theorem. Let M be a countable standard transitive model of ZF + V = L, and let ℒ Є M be a wellfounded lattice in M, with top and bottom. Let ∣ℒ∣M = λ, and suppose κ ≥ λ is a regular cardinal in M. Then there is a generic extension N of M such that(i) N and M have the same cardinals, and κN ⊂ M;(ii) the c-degrees of sets of ordinals of N form a pattern isomorphic to ℒ;(iii) if A ⊂ On and A Є N, there is B Є P(κ+)N such that L(A) = L(B).The proof proceeds by forcing with Souslin trees, and relies heavily on techniques developed by Jech. In [5] he uses these techniques to construct simple Boolean algebras in L, and in [6] he uses them to construct a model of set theory whose c-degrees have orderlype 1 + ω*.The proof also draws on ideas of Adamovicz. In [1]–[3] she obtains consistency results concerning the possible patterns of c-degrees of sets of ordinals using perfect set forcing and symmetric models. These methods have the advantage of yielding real degrees, but involve greater combinatorial complexity, in particular the use of ‘sequential representations’ of lattices.The advantage of the approach using Souslin trees is twofold: first, we can make use of ready-made combinatorial principles which hold in L, and secondly, the notion of genericity over a Souslin tree is particularly simple.

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.

scholarly journals Divergent Design of Mechanical Metamaterials Clan Deducted from Arc-serpentine Curve

2021 ◽  
Author(s):  
Shengli Mi ◽  
Hongyi Yao ◽  
Xiaoyu Zhao ◽  
Wei Sun
Keyword(s):  
Thick Plate ◽  
Three Dimensional ◽  
Spatial Arrangement ◽  
Design Strategies ◽  
Shape Morphing ◽  
Mechanical Metamaterials ◽  
Unit Cells ◽  
Combinatorial Principles ◽  
Composite Curve ◽  
Typical Design

Abstract The exotic properties of mechanical metamaterials are determined by their unit-cells' structure and spatial arrangement, in analogy with the atoms of conventional materials. Companioned with the mechanism of structural or cellular materials1–5, the ancient wisdom of origami6–11 and kirigami12–16 and the involvement of multiphysics interaction2,17,18 enrich the programable mechanical behaviors of metamaterials, including shape-morphing8,12,14,16,19, compliance4,5,8,17,20, texture2,18,21, and topology11,18,22−25. However, typical design strategies are mainly convergent, which transfers various structures into one family of metamaterials that are relatively incompatible with the others and do not fully bring combinatorial principles3,10,26 into play. Here, we report a divergent strategy that designs a clan of mechanical metamaterials with diverse properties derived from a symmetric curve consisting of serpentines and arcs. We derived this composite curve into planar and cubic unit-cells and modularized them by attaching magnetics. Moreover, stacking each of them yields two- and three-dimensional auxetic metamaterials, respectively. Assembling with both modules, we achieved three thick plate-like metamaterials separately with flexibility, in-plane buckling, and foldability. Furthermore, we demonstrated that the hybrid of paradox properties is possible by combining two of the above assembles. We anticipate that this divergent strategy paves the path of building a hierarchical library of diverse combinable mechanical metamaterials and making conventional convergent strategies more efficient to various requests. Main

scholarly journals Combinatorial Principles from Adding Cohen Reals

2017 ◽  
pp. 79-103
Author(s):  
I. Juhász ◽  
L. Soukup ◽  
Z. Szentmiklóssy
Keyword(s):  
Combinatorial Principles

Parallel strategies

2003 ◽  
Vol 68 (4) ◽  
pp. 1242-1250
Author(s):  
Pavel Pudlák
Keyword(s):  
Bounded Arithmetic ◽  
Infinite Games ◽  
Open Problems ◽  
Finite Games ◽  
Combinatorial Principles ◽  
Axiomatic Systems

AbstractWe consider combinatorial principles based on playing several two person games simultaneously. We call strategies for playing two or more games simultaneously parallel. The principles are easy consequences of the determinacy of games, in particular they are true for all finite games. We shall show that the principles fail for infinite games. The statements of these principles are of lower logical complexity than the sentence expressing the determinacy of games, therefore, they can be studied in weak axiomatic systems for arithmetic (Bounded Arithmetic). We pose several open problems about the provability of these statements in Bounded Arithmetic and related computational problems.

Sign in / Sign up

Export Citation Format

Share Document