Related papers: An applicative theory for FPH

We introduce a new concept, `(topological) (vacuum) parallel world, ' which is a new tool to research submanifolds. Roughly speaking, `Observables in (T)QFT' is equal to `a (topological) modification of space-time.' In other words, we give…

Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…

A conformable time-scale fractional calculus of order $\alpha \in ]0,1]$ is introduced. The basic tools for fractional differentiation and fractional integration are then developed. The Hilger time-scale calculus is obtained as a particular…

Fuchsian methods and their applications to the study of the structure of spacetime singularities are surveyed. The existence question for spacetimes with compact Cauchy horizons is discussed. After some basic facts concerning Fuchsian…

Kauffman's clock theorem provides a distributive lattice structure on the set of states of a four-valent graph in the plane. We prove two distinct generalisations of this theorem, for four-valent graphs embedded in more general compact…

This work is focused on constructing space-time covariance functions through a hierarchical mixture approach that can serve as building blocks for capturing complex dependency structures. This hierarchical mixture approach provides a…

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

One of the basic peoblems of quantum cosmology is the problem of time. Various solutions have been proposed for this problem. One approach is to use the Bohmian time. Another Approach is to use the probabilistic time which was recently…

We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…

In the present paper invariant subspace method has been extended for solving systems of multi-term fractional partial differential equations (FPDEs) involving both time and space fractional derivatives. Further the method has also been…

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

In this paper, we provide some new generalizations of Feng Qi type integral inequalities on time scales by using elementary analytic methods.

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Nestoridis2011}. In particular, it is demonstrated that the…

We analyze families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e., a time-dependent map expressing any solution of each of these systems in terms of a…

In a recent paper by the author, a new approach was suggested for quantising space-time, or space. This involved developing a procedure for quantising a system whose configuration space--or history-theory analogue--is the set of objects in…

This article provides a gentle introduction for a general mathematical audience to the factorization theory of motion polynomials and its application in mechanism science. This theory connects in a rather unexpected way a seemingly abstract…

The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…

We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…

Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering.…