Related papers: On a general Syracuse problem with conjectures
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…
A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…
We establish the existence of strong solutions to a class of nonlinear strongly coupled and uniform elliptic systems consisting of more than two equations. The existence of of nontrivial and non constant solutions (or pattern formations)…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
Beginning with the Bell theorem, cyclic systems of dichotomous random variables have been the object of many foundational findings in quantum mechanics. Here, we ask the question: if one chooses a cyclic system "at random" (uniformly within…
Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed…
Consider a periodically forced nonlinear system which can be presented as a collection of smaller subsystems with pairwise interactions between them. Each subsystem is assumed to be a massive point moving with friction on a compact surface,…
We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…
We explore the rational, formal and non-formal criteria of consistency, non-triviality and redundancy in the mathematical research now a days. We develop a paradigmatic discussion by analysing the different conceptions of those criteria,…
The disjunctive restricted chase is a sound and complete procedure for solving boolean conjunctive query entailment over knowledge bases of disjunctive existential rules. Alas, this procedure does not always terminate and checking if it…
Structural causal models (SCMs), also known as (nonparametric) structural equation models (SEMs), are widely used for causal modeling purposes. In particular, acyclic SCMs, also known as recursive SEMs, form a well-studied subclass of SCMs…
Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology-Based Query Answering. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure…
The monograph is concerned with some key problems of the theory of nonlinear economic dynamics. The authors' concept consists in analyzing the problem of structural instability of economic systems within the framework of the synergetic…
In the framework of certain general probability theories of single systems, we identify various nonclassical features such as incompatibility, multiple pure-state decomposability, measurement disturbance, no-cloning and the impossibility of…
The purpose of this paper is to generalize the classical Mazur's lemma from the classical convex analysis to the framework of locally $L^0$-convex modules. In this version an extra condition of countable concatenation is included. We…
We consider the Li\'enard equation and we give a sufficient condition to ensure existence and uniqueness of limit cycles. We compare our result with some other existing ones and we give some applications.
We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
We present the long sought visual pattern in the Collatz problem with the aid of a logarithmic spiral. Using this newly discovered pattern, we show that the Collatz problem is linked to primes via Jacobsthal numbers. We then prove that no…
We demonstrate that non-convex Lagrangians, as contemplated in the theory of time crystals, can arise in the effective description of conventional, physically realizable systems. Such embeddings resolve dynamical singularities which arise…