On temporal logic S4Dbr

In this paper, we study the temporal logic S4Dbr with two temporal operators “always” and “eventually.” An equivalent sequent calculus is presented with formulae as modal clauses or modal clauses starting with operator “always.” An upper bound of deduction tree is given for propositional logic. A theorem prover for propositional logic is written in SWI-Prolog. Published in LietuvosMatematikos Rinkinys, Vol. 46, No. 2, pp. 203–214, April–June, 2006.     

Game theoretical optimization inspired by information theory

Inspired by previous work on information theoretical optimization problems, the basics of an axiomatic theory of certain special two-person zero-sum games is developed. One of the players, “Observer”, is imagined to have a “mind”, the other, “Nature”, not. These ideas lead to un-symmetric modeling as the two players are treated quite differently. Basic concavity- and convexity results as well as a general minimax theorem are derived from the axioms.     

Weyl-Eddington-Einstein affine gravity in the context of modern cosmology

We propose new models of the “affine” theory of gravity in multidimensional space-times with symmetric connections. We use and develop ideas of Weyl, Eddington, and Einstein, in particular, Einstein’s proposed method for obtaining the geometry using the Hamilton principle. More specifically, the connection coefficients are determined using a “geometric” Lagrangian that is an arbitrary function of the generalized (nonsymmetric) Ricci curvature tensor (and, possibly, other fundamental tensors) expressed in terms of the connection coefficients regarded as independent variables. Such a theory supplements the standard Einstein theory with dark energy (the cosmological constant, in the first approximation), a neutral massive (or tachyonic) meson, and massive (or tachyonic) scalar fields. These fields couple only to gravity and can generate dark matter and/or inflation. The new field masses (real or imaginary) have a geometric origin and must appear in any concrete model. The concrete choice of the Lagrangian determines further details of the theory, for example, the nature of the fields that can describe massive particles, tachyons, or even “phantoms.” In “natural” geometric theories, dark energy must also arise. The basic parameters of the theory (cosmological constant, mass, possible dimensionless constants) are theoretically indeterminate, but in the framework of modern “multiverse” ideas, this is more a virtue than a defect. We consider further extensions of the affine models and in more detail discuss approximate effective (“physical”) Lagrangians that can be applied to the cosmology of the early Universe.     

The three-in-a-tree problem

We show that there is a polynomial time algorithm that, given three vertices of a graph, tests whether there is an induced subgraph that is a tree, containing the three vertices. (Indeed, there is an explicit construction of the cases when there is no such tree.) As a consequence, we show that there is a polynomial time algorithm to test whether a graph contains a “theta” as an induced subgraph (this was an open question of interest) and an alternative way to test whether a graph contains a “pyramid” (a fundamental step in checking whether a graph is perfect).     

Free limits of forcing and more on Aronszajn trees

We prove that the Souslin Hypothesis does not imply “every Aron. (=Aronszajn) tree is special”. For this end we introduce variants of the notion “special Aron. tree”. We also introduce a limit of forcings bigger than the inverse limit, and prove it preserves properness and related notions not less than inverse limit, and the proof is easier in some respects. The result was announced in [9]. The author thanks Uri Avraham for detecting many errors.     

The Geometry of Standard Deontic Logic

Whereas geometrical oppositions (logical squares and hexagons) have been so far investigated in many fields of modal logic (both abstract and applied), the oppositional geometrical side of “deontic logic” (the logic of “obligatory”, “forbidden”, “permitted”, . . .) has rather been neglected. Besides the classical “deontic square” (the deontic counterpart of Aristotle’s “logical square”), some interesting attempts have nevertheless been made to deepen the geometrical investigation of the deontic oppositions: Kalinowski (La logique des normes, PUF, Paris, 1972) has proposed a “deontic hexagon” as being the geometrical representation of standard deontic logic, whereas Joerden (jointly with Hruschka, in Archiv für Rechtsund Sozialphilosophie 73:1, 1987), McNamara (Mind 105:419, 1996) and Wessels (Die gute Samariterin. Zur Struktur der Supererogation, Walter de Gruyter, Berlin, 2002) have proposed some new “deontic polygons” for dealing with conservative extensions of standard deontic logic internalising the concept of “supererogation”. Since 2004 a new formal science of the geometrical oppositions inside logic has appeared, that is “n-opposition theory”, or “NOT”, which relies on the notion of “logical bi-simplex of dimension m” (m = n − 1). This theory has received a complete mathematical foundation in 2008, and since then several extensions. In this paper, by using it, we show that in standard deontic logic there are in fact many more oppositional deontic figures than Kalinowski’s unique “hexagon of norms” (more ones, and more complex ones, geometrically speaking: “deontic squares”, “deontic hexagons”, “deontic cubes”, . . ., “deontic tetraicosahedra”, . . .): the real geometry of the oppositions between deontic modalities is composed by the aforementioned structures (squares, hexagons, cubes, . . ., tetraicosahedra and hyper-tetraicosahedra), whose complete mathematical closure happens in fact to be a “deontic 5-dimensional hyper-tetraicosahedron” (an oppositional very regular solid).      

A simple proof of the ergodic theorem using nonstandard analysis

A simple proof of the individual ergodic theorem is given. The essential tool is the nonstandard measure theory developed by P. Loeb. Any dynamical system on an abstract Lebesgue space can be represented as a factor of a “cyclic” system with a hyperfinite cycle. The ergodic theorem for such a “cyclic” system is almost trivial because of its simple structure. The general case follows from this special case.     

Pseudo-holomorphic maps and bubble trees

This paper proves a strong convergence theorem for sequences of pseudo-holomorphic maps from a Riemann surface to a symplectic manifoldN with tamed almost complex structure. (These are the objects used by Gromov to define his symplectic invariants.) The paper begins by developing some analytic facts about such maps, including a simple new isoperimetric inequality and a new removable singularity theorem. The main technique is a general procedure for renormalizing sequences of maps to obtain “bubbles on bubbles.” This is a significant step beyond the standard renormalization procedure of Sacks and Uhlenbeck. The renormalized maps give rise to a sequence of maps from a “bubble tree”—a map from a wedge Σ V S² V S² V ... →N. The main result is that the images of these renormalized maps converge in L^1,2 ∪C° to the image of a limiting pseudo-holomorphic map from the bubble tree. This implies several important properties of the bubble tree. In particular, the images of consecutive bubbles in the bubble tree intersect, and if a sequence of maps represents a homology class then the limiting map represents this class.     

Combinatorial Groupoids,Cubical Complexes,and the Lovász Conjecture

This paper lays the foundation for a theory of combinatorial groupoids that allows us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature”, etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. We introduce a new, holonomy-type invariant for cubical complexes, leading to a combinatorial “Theorema Egregium” for cubical complexes that are non-embeddable into cubical lattices. Parallel transport of Hom-complexes and maps is used as a tool to extend Babson–Kozlov–Lovász graph coloring results to more general statements about nondegenerate maps (colorings) of simplicial complexes and graphs. The author was supported by grants 144014 and 144026 of the Serbian Ministry of Science and Technology.     

Convex programming with single separable constraint and bounded variables

In this paper a minimization problem with convex objective function subject to a separable convex inequality constraint “≤” and bounded variables (box constraints) is considered. We propose an iterative algorithm for solving this problem based on line search and convergence of this algorithm is proved. At each iteration, a separable convex programming problem with the same constraint set is solved using Karush-Kuhn-Tucker conditions. Convex minimization problems subject to linear equality/ linear inequality “≥” constraint and bounds on the variables are also considered. Numerical illustration is included in support of theory.     

More examples of invariance under twisting

The so-called “invariance under twisting” for twisted tensor products of algebras is a result stating that, if we start with a twisted tensor product, under certain circumstances we can “deform” the twisting map and we obtain a new twisted tensor product, isomorphic to the given one. It was proved before that a number of independent and previously unrelated results from Hopf algebra theory are particular cases of this theorem. In this article we show that some more results from literature are particular cases of invariance under twisting, for instance a result of Beattie-Chen-Zhang that implies the Blattner-Montgomery duality theorem.     

A Generalization of the Lorentz Ether to Gravity with General-Relativistic Limit

Does relativistic gravity provide arguments against the existence of a preferred frame? Our answer is negative. We define a viable theory of gravity with preferred frame. In this theory, the EEP holds exactly, and the Einstein equations of GR limit are obtained in a natural limit. Despite some remarkable differences (stable “frozen stars” instead of black holes, a “big bounce” instead of the big bang, exclusion of nontrivial topologies and closed causal loops, and a preference for a flat universe) the theory is viable.     

Generalized correlated equilibrium for two-person games in extensive form with perfect information

A correlation scheme (leading to a special equilibrium called “soft” correlated equilibrium) is applied for two-person finite games in extensive form with perfect information. Randomization by an umpire takes place over the leaves of the game tree. At every decision point players have the choice either to follow the recommendation of the umpire blindly or freely choose any other action except the one suggested. This scheme can lead to Pareto-improved outcomes of other correlated equilibria. Computational issues of maximizing a linear function over the set of soft correlated equilibria are considered and a linear-time algorithm in terms of the number of edges in the game tree is given for a special procedure called “subgame perfect optimization”.     

Nevanlinna theory, diophantine approximation, and numerical analysis

This article treats the problem of the approximation of an analytic function f on the unit disk by rational functions having integral coefficients, with the goodness of each approximation being judged in terms of the maximum of the absolute values of the coefficients of the rational function. This relates to the more usual approximation by a rational function in that it could imply how many decimal places are needed when applying a particularly good rational function approximation having non-integrad coefficients. It is shown how to obtain “good” approximations of this type and it is also shown how under certain circumstances “very good” bounds are not possible. As in diophantine approximation this means that many merely “good” approximations do exist, which may be the preferable case. The existence or nonexistence of “very good” approximations is closely related to the diophantine approximation of the first nonzero power series coefficient of at z=0. Nevanlinna theory methods are used in the proofs.     

Averaging the operators for a large number of clusters: Phase transitions

We develop the theory of averaging the operators in a Fock space, introduced in our previous papers. We find the algebra of mean operators. We introduce the quantum entropy and quantum free energy using the function f(z)=zlog(z) of the mean unit operator (the “measure” of mean operators). Such a “quantum thermodynamics” determines the temperature dependence of the critical speed (“the Landau criterion”) and the temperature distribution at which the speed of a superfluid system is nonzero even at zero temperature. We generalize the consideration to the case where sparsely distributed bosons form clusters. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 125, No. 2, pp. 297–314, November, 2000.     

Hamilton cycles in highly connected and expanding graphs

In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on two properties only: one requiring expansion of “small” sets, the other ensuring the existence of an edge between any two disjoint “large” sets. We also discuss applications in positional games, random graphs and extremal graph theory.     

Two faces of mathematics lessons in Korea: conventional lessons and innovative lessons

This study identifies the characteristics of mathematics classrooms in Korea. First, conventional Korean mathematics lessons are analyzed from the perspective of “theory of variation”. Second, an innovative lesson for gifted children is reported in detail and analyzed from the perspective of “Lakatos’ proofs and refutations”. Third, the classroom characteristics identified in both the conventional lessons and the innovative lesson are interpreted in terms of the underlying cultural values that they share with other East Asian countries. The study concludes that although the two faces of Korean mathematics lessons look different, they may flow from the same “heart”—that of the common Confucian heritage culture culture, and in particular East Asian pragmatism.     

The weight-decay technique in learning from data: an optimization point of view

The technique known as “weight decay” in the literature about learning from data is investigated using tools from regularization theory. Weight-decay regularization is compared with Tikhonov’s regularization of the learning problem and with a mixed regularized learning technique. The accuracies of suboptimal solutions to weight-decay learning are estimated for connectionistic models with a-priori fixed numbers of computational units. The Authors were partially supported by a PRIN grant from the Italian Ministry for University and Research, project “Models and Algorithms for Robust Network Optimization”.     

“Miniaturized” Linearizations for Quadratic 0/1 Problems

In order to solve a quadratic 0/1 problem, some techniques, consisting in deriving a linear integer formulation, are used. Those techniques, called “linearization”, usually involve a huge number of additional variables. As a consequence, the exact resolution of the linear model is, in general, very difficult. Our aim, in this paper, is to propose “economical” linear models. Starting from an existing linearization (typically the so-called “classical linearization”), we find a new linearization with fewer variables. The resulting model is called “Miniaturized” linearization. Based on this approach, we propose a new linearization scheme for which numerical tests have been performed.     

A Short and Partial History of Probabilistic Normed Spaces

This contribution aims at presenting a survey of a portion of the theory of Probabilistic Normed spaces. No result will be proved, so that the reader is referred to the original sources for the proofs. The theory of PN spaces has many facets and touches on many branches of mathematics, for instance, geometry, functional analysis, topology, probability. This justifies the adjective “partial” that appears in the title. Therefore, it is perhaps better to declare from the start what one may expect from this survey. It is only natural to investigate which “classical”properties of normed spaces are preserved in the new setting. But it is probably more interesting to look for those properties that pertain to the new theory and which have no corresponding analogue in the classical theory. It must also be added that Probabilistic Normed spaces may be approached from different standpoints: they may be studied for their own sake, as a special subject in functional analysis or in topology that is worth investigating simply because it is there, or because it provides a tool to approach open problems or, again, to shed light on topics that one thought had been thoroughly investigated. In this, one thinks immediately of the possible applications in probability and statistics. This paper was written as a part of the project “Metodi stocastici in finanza matematica” of the Italian M.I.U.R..