MathSciDoc: An Archive for Mathematician ∫

Resolution Matrix Semantics (RMS) introduces a novel truth-value-based framework for modal logic, providing a substantive alternative to Kripke’s relational semantics of possible worlds. Drawing inspiration from Y. Ivlev’s substantive semantics, RMS utilizes a 4-valued structure—necessary truth (tn), contingent truth (tc), contingent false (fc), and necessary false (fn)—augmented by indeterminate values (t, f, t/f) to define modal systems Km, KDm, KTm, S4m, and S5m, analogous to Kripke’s K, KD, T, S4, and S5. By directly assigning determined and indeterminate truth values via an interpretation function, RMS validates formulas without relying on accessibility relations, as demonstrated through soundness and completeness proofs and a tailored tableau method. The framework’s versatility extends to applications in deontic logic, artificial intelligence, and quantum computing, enabling context-dependent reasoning with computational efficiency. RMS thus bridges philosophical logic and practical domains, offering a truth-centric perspective on modal reasoning’s complexities.

Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. P. Erdos raised the problem of determining $f(n)$ (see J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976), p.247, Problem 11). We present the problems, conjectures related to this problems and we summarize the know results. We make the following conjecture: \par \noindent{\bf Conjecture } $$\lim\sb {n \to \infty} {f(n)-n \over \sqrt n} = \sqrt {2 + \frac{4}{9}}.$$

We show that the order of the cardinality of maximal complete $1$-systems of loops on non-orientable surfaces is $\sim |\chi|^{2}$. In particular, we determine the exact cardinality of maximal complete $1$-systems of loops on punctured projective planes. To prove these results, we show that the cardinality of maximal systems of arcs pairwise-intersecting at most once on a non-orientable surface is $2|\chi|(|\chi|+1)$.

No abstract uploaded!

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a realization containing a $K_{m}-H$ as a subgraph. Let $\sigma(K_{m}-H, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(K_{m}-H, n)$ is potentially $K_{m}-H$-graphical. In this paper, we determine the values of $\sigma (K_{r+1}-Z, n)$ for $n\geq 5r+19, r+1 \geq k \geq 5,$ $j \geq 5$ where $Z$ is a graph on $k$ vertices and $j$ edges which contains a graph $Z_4$ but not contains a cycle on $4$ vertices. We also determine the values of $\sigma (K_{r+1}-Z_4, n)$, $\sigma (K_{r+1}-(K_4-e), n)$, $\sigma (K_{r+1}-K_4, n)$ for $n\geq 5r+16, r\geq 4$.

This research provides insights for the separation of cryptocurrencies from other assets. Using dimensionality reduction techniques, we show that most of the variation among cryptocurrencies, stocks, exchange rates, commodities, bonds, and real estate indexes can be explained by the tail, memory and moment factors of their log-returns. By applying various classification methods, cryptocurrencies are categorized as a separate asset class, mainly due to the tail factor. The main result is the complete separation of cryptocurrencies from the other asset types, using the Maximum Variance Components Split method. Additionally, we show that cryptocurrencies tend to exhibit similar characteristics over time and become more distinguished from other asset classes (synchronic evolution).

No abstract uploaded!

In a former paper we proposed a model for the quantization of gravity by working in a bundle $E$ where we realized the Hamilton constraint as the Wheeler-DeWitt equation. However, the corresponding operator only acts in the fibers and not in the base space. Therefore, we now discard the Wheeler-DeWitt equation and express the Hamilton constraint differently, either with the help of the Hamilton equations or by employing a geometric evolution equation. There are two possible modifications possible which both are equivalent to the Hamilton constraint and which lead to two new models. In the first model we obtain a hyperbolic operator that acts in the fibers as well as in the base space and we can construct a symplectic vector space and a Weyl system. In the second model the resulting equation is a wave equation in $\so \times (0,\infty)$ valid in points $(x,t,\xi)$ in $E$ and we look for solutions for each fixed $\xi$. This set of equations contains as a special case the equation of a quantized cosmological Friedman universe without matter but with a cosmological constant, when we look for solutions which only depend on $t$. Moreover, in case $\so$ is compact we prove a spectral resolution of the equation.

We show that the pre-order defined on the category of contact manifolds by arbitrary symplectic cobordisms is considerably less rigid than its counterparts for exact or Stein cobordisms: in particular, we exhibit large new classes of contact 3-manifolds which are symplectically cobordant to something overtwisted, or to the tight 3-sphere, or which admit symplectic caps containing symplectically embedded spheres with vanishing self-intersection. These constructions imply new and simplified proofs of several recent results involving fillability, planarity, and non-separating contact type embeddings. The cobordisms are built from symplectic handles of the form Σ × D and Σ × [−1, 1] × S1, which have symplectic cores and can be attached to contact 3-manifolds along sufficiently large neighborhoods of transverse links and preLagrangian tori. We also sketch a construction of J-holomorphic foliations in these cobordisms and formulate a conjecture regarding maps induced on Embedded Contact Homology with twisted coefficients.

No abstract uploaded!