In series of articles we continue to advance idea that mathematics and physics is the same. We bring forward two basic assumptions as principles. First is the primacy of life as opposed to dominating...
On to what effect LHC experiment should arrive (2010)
We consider idea of hierarchical multitime notion and of the cone of creation. Following this idea, the time used in traditional sense is only a single projection of time in the multitime. Multitime...
ORNAMENTAL SIGN LANGUAGE IN THE FIRST ORDER TRACERY BELTS (2010)
Tenisons, Modris, Zeps, Dainis
We consider ornamental sign language of first order where principles of sieve displacement, of asymmetric building blocks as base of ornament symmetry, color exchangeability and side equivalence...
Our Ability to Research Comes Before Understanding of What We Research (2010)
Impact of quantum mechanics on physical science epistemology and science at all is considered. We consider methodolically idea that science doesn’t research its assumed objects but the ability to...
Forbidden Minors for Projective Plane are Free-Toroidal or Non-Toroidal (2010)
Forbidden graphs for projective plane are examined. Using mostly computer, we test how many edges may be added so that these graphs remain free-toroidal. Using the method, some forbidden graphs on...
In place of traditional controverse, evolution versus creationism, we suggest many quantum mechanical theories, that from different points of views trying to consider basic physical theories and even...
Titans, Normunds, Feščenko, Iļja, Zeps, Dainis, Kasaross, Mārtiņš, Mičulis, Kaspars, Atvars, Aigars, ...
LU 68. zinātniskā konference. Teoloģijas fakultātes sekcija „Zinātnes un Reliģijas dialogs”. „Zinātnes un reliģijas dialoga” interdisciplinārās grupas sēde 2010. gada 12....
The Double Rotation as Invariant of Motion in Quantum Mechanics (2010)
Quantum mechanics may loose its weirdness if systematically geometric algebra methods would be used more and more. Crucial aspect is to find laws of quantum mechanics be present in macroworld in form...
We suggest new approach to what should be considered money. We argue that not money itself should be measurable quantity but change of it, thus, entering gauge freedom action in economics in analogy...
May we imagine that materialistic and idealistic thinkers were both right in all point concerning mind and matter they have quarrelled for centuries? May we imagine that in quarrel for primacy...
aimed to build language teaching exercises (2009)
example of using electronic dictionary tools
Free Planar Graphs on Torus (2009)
Graph on plane, projective plane or torus is free planar if it remains embeddable in corresponding surface if arbitrary edge is added. Free planar graph is called ladder-augmentable if two edges in...
Forbidden Minors for Projective Plane are Free-Toroidal or Non-Toroidal (2009)
Forbidden graphs for projective plane are examined. Using mostly computer, we test how many edges may be added so that these graphs remain free-toroidal. Using the method, some forbidden graphs on...
aimed to build language teaching exercises (2009)
example of using electronic dictionary tools
On Reference System of Life (2009)
We argue cognition may be considered in new outline, i.e., as functionality of life from within reference system of life. We conjecture that this give us way to consider mathematics as aspect of life...
Hologram and distinction. The physics of time (2009)
There are two times in Greek kairos (�������) and chronos (�������). There are two cerebral hemispheres, left and right, correspondingly, left which communicates via...
Dainis Zeps, Dainis Zeps, Dainis Zeps
The theory of combinatorial maps and its use in the graph-topological computations
The One Savior Paradigm (2009)
The one savior paradigm is discussed not only as doctrinal aspect of religious teachings but as one of mostly manifested aspect of our psychic that should be adequately investigated. We suggest...
The Learning of Ancient Languages as (super)Human Effort (2009)
Problems around teaching ancient languages are discussed. It is suggested to assume that learning and teaching of languages require some superhuman effort. Author’s experience of teaching ancient...
Free Minor Closed Classes and the Kuratowski theorem (2009)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations,...
Combinatorial map as multiplication ofcombinatorial knots (2009)
Abstract We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot's square and trivial knot ( = u * *2...
Quantum Distinction: Quantum Distinctiones! (2009)
How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and...
Quantum Distinction: Quantum Distinctiones! (2009)
How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and...
We suggest new approach to what should be considered money. We argue that not money itself should be measurable quantity but change of it, thus, entering gauge freedom action in economics in analogy...
World’s Economy: what is money? Physicist’s approach to tendencies in world’s economy (2009)
We run economy not knowing rules of what we are running. Commonwealth maybe should be allowed to functionate under its own rules that should be discovered, similar to these in physics or biology. By...
World’s Economy: what is money? Physicist’s approach to tendencies in world’s economy (2009)
We run economy not knowing rules of what we are running. Commonwealth maybe should be allowed to functionate under its own rules that should be discovered, similar to these in physics or biology. By...
Science and Religion: Controverse or Complementarity (2009)
Science and Religion: controverse or complementarity Relations between science and religion since times of Galileo, Newton and Leibniz discussed . Omega point approach considered and interpreted:...
Quantum Distinction: Quantum Distinctiones! (2009)
How many distinctions, in Latin, quantum distinctions have? We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics...
The Double Rotation as Invariant of Motion in Quantum Mechanics (2009)
Quantum mechanics may loose its weirdness if systematically geometric algebra methods would be used more. Crucial aspect is to find laws of quantum mechanics be present in macroworld in form of...
The Double Rotation as Invariant of Motion in Quantum Mechanics (2009)
Quantum mechanics may loose its weirdness if systematically geometric algebra methods would be used more. Crucial aspect is to find laws of quantum mechanics be present in macroworld in form of...
Quantum Distinction: Quantum Distinctiones! (2009)
How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and...
Quantum Distinction: Quantum Distinctiones! (2009)
How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and...
Mathematics as Reference System of Life: preliminary observations (2009)
We forward hypothesis that all what we refer to as mathematics are cognitive aspects of life, moreover, we have right to refer to mathematics as reference system of life. Mathematics and cognition...
Building Mathematics via Theorem Windows (2009)
Quantum mechanical model with singularities triplets is condisered. How life functions via mechanism which is built from what we call theorem windows we are trying to imagine and to model. Key words:...
The Learning of Ancient Languages as (super)Human Effort (2009)
Problems around teaching ancient languages are discussed. It is suggested to assume that learning and teaching of languages require some superhuman effort. Author’s experience of teaching ancient...
The Double Rotation as Invariant of Motion in Quantum Mechanics (2009)
Quantum mechanics may loose its weirdness if systematically geometric algebra methods would be used more. Crucial aspect is to find laws of quantum mechanics be present in macroworld in form of...
Four levels of complexity in mathematics and physics. Riga : Quantum Distinctions (2009)
Four levels of complexity in mathematics and physics are considered, how they are interrelated, how this all has impact on other subjects of epistemology.
World’s Economy: what is money? Physicist’s approach to tendencies in world’s economy (2009)
Today economy is run without knowing the rules. Perhaps commonwealth should be allowed to function under its own laws that could be discovered similarly to those in physics or biology. Moreover,...
Inside Outside Equivalence in Mathematics and Physics (2009)
We go on considering mathematics as reference system of life introduced in preprint article (1) Zeps, Dainis. Mathematics as Reference System of Life: preliminary observations. Riga: Internet...
The Double Rotation as Invariant of Motion in Quantum Mechanics (2009)
Quantum mechanics may loose its weirdness if systematically geometric algebra methods would be used more. Crucial aspect is to find laws of quantum mechanics be present in macroworld in form of...
The One Savior Paradigm (2009)
The one savior paradigm is discussed not only as doctrinal aspect of religious teachings but as one of mostly manifested aspect of our psychic that should be adequately investigated. We suggest...
Quantum Distinction: Quantum Distinctiones! (2009)
How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and...
The Double Rotation as Invariant of Motion in Quantum Mechanics (2009)
Quantum mechanics may loose its weirdness if systematically geometric algebra methods would be used more. Crucial aspect is to find laws of quantum mechanics be present in macroworld in form of...
We forward hypothesis that all what we refer to as mathematics are cognitive aspects of life, moreover, we have right to refer to mathematics as reference system of life. Mathematics and cognition...
Application of the Free Minor Closed Classes in the Context of the Four Color Theorem (2008)
Four color theorem, using concept of free-planar graphs, is discussed.
Application of the Free Minor Closed Classes in the Context of the Four Color Theorem (2008)
Four color theorem, using concept of free-planar graphs, is discussed.
FREE PLANAR GRAPHS ON TORUS (2008)
Graph on plane, projective plane or torus is free planar if it remains embeddable in corresponding surface after arbitrary edge is added. Free planar graph is called ladder-augmentable if two edges...
Application of the Free Minor Closed Classes in the Context of the Four Color Theorem (2008)
Four color theorem, using concept of free-planar graphs, is discussed.
Application of the Free Minor Closed Classes in the Context of the Four Color Theorem (2008)
Four color theorem, using concept of free-planar graphs, is discussed.
Pythagorean numbers Let Pythagorean number be triple, with first two elements as projections and third as arrow of where is called projection of distinction and projection of hologram. Pythagorean...
In his excellent book (Smolin, 2006) Lee Smolin speaks about crisis in physics, blaming mainly string theory. We argue that modern physics should change its attitude towards what is called observer,...
Application of the Free Minor Closed Classes in the Context of the Four Color Theorem (2008)
Four color theorem, using concept of free-planar graphs, is discussed.
Combinatorial map as multiplication of combinatorial knots (2007)
We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot's square and trivial knot.
Combinatorial map as multiplication of combinatorial knots (2007)
We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot's square and trivial knot.
Idea that mathematics should be considered as creative order in nature is considered.
Combinatorial map as multiplication of combinatorial knots (2007)
We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot's square and trivial knot.
Combinatorial map as multiplication of combinatorial knots (2007)
We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot's square and trivial knot.
Abstract. Four color theorem, using concept of free-planar graphs, is discussed. 1
On to what effect LHC experiments should arrive (2007)
We consider idea of hierarchical multitime notion and of the cone of creation. Following this idea, the time used in traditional sense is only a single projection of time in the multitime. Multitime...
Combinatorial map as multiplication of combinatorial knots (2007)
We show that geometrical map can be expressed as multiplication of combinatorial maps, i.e. map P is equal to multiplication of its knot, inner knot's square and trivial knot.
Latin Dictionary Tools in Internet (2004)
Latin Dictionary Tools Page http://lingua.id.lv/lingua.htm is produced for teachers and students of Latin to have an access to a large Latin morphological dictionary data base in Internet. Dictionary...
Latin Dictionary Tools in Internet (2004)
Latin Dictionary Tools Page http://lingua.id.lv/lingua.htm is produced for teachers and students of Latin to have an access to a large Latin morphological dictionary data base in Internet. Dictionary...
Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability (2004)
Free toroidal graphs are examined whether they may be augmented unboundedly retaining freeness. Two types of augment are distinguished where both so called punkah and ladder augments applied...
Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability (2004)
Free toroidal graphs are examined whether they may be augmented unboundedly retaining freeness. Two types of augment are distinguished where both so called punkah and ladder augments applied...
Latin Dictionary Tools in Internet (2004)
Latin Dictionary Tools Page http://lingua.id.lv/lingua.htm is produced for teachers and students of Latin to have an access to a large Latin morphological dictionary data base in Internet. Dictionary...
Latin Dictionary Tools in Internet (2004)
Latin Dictionary Tools Page http://lingua.id.lv/lingua.htm is produced for teachers and students of Latin to have an access to a large Latin morphological dictionary data base in Internet. Dictionary...
Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability (2004)
Free toroidal graphs are examined whether they may be augmented unboundedly retaining freeness. Two types of augment are distinguished where both so called punkah and ladder augments applied...
Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability (2004)
Free toroidal graphs are examined whether they may be augmented unboundedly retaining freeness. Two types of augment are distinguished where both so called punkah and ladder augments applied...
Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability (2004)
Free toroidal graphs are examined whether they may be augmented unboundedly retaining freeness. Two types of augment are distinguished where both so called punkah and ladder augments applied...
Latin Dictionary Tools in Internet (2004)
Latin Dictionary Tools Page http://lingua.id.lv/lingua.htm is produced for teachers and students of Latin to have an access to a large Latin morphological dictionary data base in Internet. Dictionary...
On Free Minor Closed Classes of Graphs Outside Planarity (2001)
It is shown that the class of graphs on projective plane is not M-class [defined in [3,4,5]] but class of graphs on torus is M-class, i.e., the forbidden minors for free minor closed class of graphs...
On Free Minor Closed Classes of Graphs Outside Planarity (2001)
It is shown that the class of graphs on projective plane is not M-class [defined in [3,4,5]] but class of graphs on torus is M-class, i.e., the forbidden minors for free minor closed class of graphs...
On Free Minor Closed Classes of Graphs Outside Planarity (2001)
It is shown that the class of graphs on projective plane is not M class [de ned in [3, 4, 5]] but the class of graphs on torus is M class, i. e. the forbidden minors for free minor closed class of...
On Free Minor Closed Classes of Graphs Outside Planarity (2001)
It is shown that the class of graphs on projective plane is not M-class [defined in [3,4,5]] but class of graphs on torus is M-class, i.e., the forbidden minors for free minor closed class of graphs...
On Free Minor Closed Classes of Graphs Outside Planarity (2001)
It is shown that the class of graphs on projective plane is not M-class [defined in [3,4,5]] but class of graphs on torus is M-class, i.e., the forbidden minors for free minor closed class of graphs...
On Free Minor Closed Classes of Graphs Outside Planarity (2001)
It is shown that the class of graphs on projective plane is not M-class [defined in [3,4,5]] but class of graphs on torus is M-class, i.e., the forbidden minors for free minor closed class of graphs...
Trying to Prove Kuratowski Theorem from Below (2000)
This note examines possibility to prove the Kuratowski theorem from below, i.e., assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowksi theorem for 3-connected...
Trying to Prove Kuratowski Theorem from Below (2000)
This note examines possibility to prove the Kuratowski theorem from below, i.e., assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowksi theorem for 3-connected...
Trying to prove the Kuratowski theorem from below (2000)
This note examines possibility to prove the Kuratowski theorem from below, i.e. assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowski theorem for 3-connected...
Trying to Prove Kuratowski Theorem from Below (2000)
This note examines possibility to prove the Kuratowski theorem from below, i.e., assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowksi theorem for 3-connected...
Trying to Prove Kuratowski Theorem from Below (2000)
This note examines possibility to prove the Kuratowski theorem from below, i.e., assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowksi theorem for 3-connected...
Kuratowski Theorem from below (2000)
This note proves the Kuratowski theorem from below, i.e. assuming that Kuratowski-like theorem for Free-Planar graphs is right. Graph is defined as a pair of sets (V, E), where V is the set of...
Kuratowski Theorem from below (2000)
A planar graph is called free-planar, if after adding an arbitrary edge it remains to be planar [1]. Here is shown that it is possible to give a proof of a Kuratowski like theorem for the free-planar...
Trying to Prove Kuratowski Theorem from Below (2000)
This note examines possibility to prove the Kuratowski theorem from below, i.e., assuming that Kuratowski-like theorem for free-planar graphs is right. Version of Kuratowksi theorem for 3-connected...
Using combinatorial maps in graph-topological computations (1998)
Possible use of combinatorial maps in graph-theoretical calculations are investigated continuing[10]. Some new permutational functions with interesting graph-topological interpretations are...
Using combinatorial maps in graph-topological computations (1998)
Possible use of combinatorial maps in graph-theoretical calculations are investigated continuing[10]. Some new permutational functions with interesting graph-topological interpretations are...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
Free Minor Closed Classes and the Kuratowski theorem. (1998)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
Free Minor Closed Classes and the Kuratowski theorem. (1998)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
Free Minor Closed Classes and the Kuratowski theorem. (1998)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
Free Minor Closed Classes and the Kuratowski theorem. (1998)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
Using combinatorial maps in graph-topological computations (1998)
Possible use of combinatorial maps in graph-theoretical calculations are investigated continuing[10]. Some new permutational functions with interesting graph-topological interpretations are...
Using combinatorial maps in graph-topological computations (1998)
Possible use of combinatorial maps in graph-theoretical calculations are investigated continuing[10]. Some new permutational functions with interesting graph-topological interpretations are...
Free Minor Closed Classes and the Kuratowski theorem (1998)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered. We are...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
Using combinatorial maps in graph-topological computations (1998)
Possible use of combinatorial maps in graph-theoretical calculations are investigated continuing[10]. Some new permutational functions with interesting graph-topological interpretations are...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
Free Minor Closed Classes and the Kuratowski theorem. (1998)
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
The theory of combinatorial maps and its use in the graph-topological computations. (1998)
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi,...
The use of combinatorial maps in graph-topological computations (1996)
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial...
The use of combinatorial maps in graph-topological computations (1996)
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial...
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations,...
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations,...
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations,...
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations,...
The use of combinatorial maps in graph-topological computations (1996)
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial...
The use of combinatorial maps in graph-topological computations (1996)
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial...
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial...
The use of combinatorial maps in graph-topological computations (1996)
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial...
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations,...
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles (1980)
The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on...
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles (1980)
The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on...
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles (1980)
The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on...
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles (1980)
The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on...
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles (1980)
The paper suggests an exhaustive search algorithm for finding Hamiltonian circuits in an undirected graph based on depth-first search and working successfully on sparse graphs. The method is based on...
We suggest new approach to what should be considered money. We argue that not money itself should be measurable quantity but change of it, thus, entering gauge freedom action in economics in analogy...
World’s Economy: what is money? Physicist’s approach to tendencies in world’s economy
We run economy not knowing rules of what we are running. Commonwealth maybe should be allowed to functionate under its own rules that should be discovered, similar to these in physics or biology. By...
The one savior paradigm is discussed not only as doctrinal aspect of religious teachings but as one of mostly manifested aspect of our psychic that should be adequately investigated. We suggest...
Four levels of complexity in mathematics and physics
Four levels of complexity in mathematics and physics are considered, how they are interrelated, how this all has impact on other subjects of epistemology.
Rudolf Steiner. On mathematics and Reality
We consider philosopher and mystic Rudolf Steiner as a searcher after new scientific paradigm who wants to put in the ground of his system mathematics and mathematical thinking, remaining by this in...