We show that, as in the case of the principle of minimum action in classical and quantum mechanics, there exists an even more general principle in the very fundamental structure of quantum space-time: This is the principle of minimal group that allows to consistently and simultaneously obtain a natural description of the spacetime dynamics and the physical states admissible in it. The theoretical construction is based on the physical states that are average values of the generators of the Metaplectic group Mp(n) , the double covering of SL(2C) in a vector representation, with respect to the coherent states carrying the spin weight. Our main results here are: (i) There exists a connection between the dynamics given by the Metaplectic group symmetry generators and the physical states (mappings of the generators through bilinear combinations of the basic states). (ii) The ground states are coherent states of the Perelomov-Klauder type defined by the action of the Metaplectic group which divide the Hilbert space into even and odd states mutually orthogonal. They carry a spin weight 1/4 and 3/4 respectively from which, two other basic states can be formed. (iii) The physical states, mapped bilinearly with the basic 1/4 and 3/4 spin weight states, plus their symmetric and antisymmetric combinations, have spin contents s = 0, 1/2, 1, 3/2 and 2. (iv) The generators realized with the bosonic variables of the harmonic oscillator introduce a natural supersymmetry and a superspace whose line element is the geometrical Lagrangian of our model. (v) From the line element as operator level, a coherent physical state of spin 2 can be obtained and naturally related to the metric tensor. (vi) The metric tensor is naturally discretized by taking the discrete series given by the basic states (coherent states) in the n number representation, reaching the classical (continuous) space-time for n going to infinity. (vii) There emerges a relation between the eigenvalue of our coherent state metric solution and the black hole area (entropy) as A_{bh}/4 l_{p}^{2} = I alpha I relating the phase space of the metric found g_{ab} and the black hole area A_{bh} through the Planck length l_{p}^{2} and the eigenvalue I alpha I of the coherent states. As a consequence of the lowest level of the quantum discrete space-time spectrum, eg the ground state associated to n = 0 and its characteristic length, there exists a minimum entropy related to the black hole history.

Accurate climate data at fine spatial resolution are essential for scientific research and the development and planning of crucial social systems, such as energy and agriculture. Among them, sea surface temperature plays a critical role as the associated El Niño-Southern Oscillation (ENSO) is considered a significant signal of global interannual climate system. In this paper, we propose an implicit neural representation-based interpolation method with temporal information (T_INRI) to reconstruct climate data of high spatial resolution, with sea surface temperature as the research object. Traditional deep learning models for generating high-resolution climate data are only applicable to fixed resolution enhancement scales. In contrast, the proposed T_INRI method is not limited to the enhancement scale provided during the training process and its results indicate that it can enhance low-resolution input by arbitrary scale. Additionally, we discuss the impact of temporal information on the generation of high-resolution climate data, specifically, which month the low-resolution sea surface temperature data is from. Our experimental results indicate that T_INRI is advantageous over traditional interpolation methods under different enhancement scales, and the temporal information can improve T_INRI performance for a different calendar month. We also examined the potential capability of T_INRI in recovering missing grid value. These results demonstrate that the proposed T_INRI is a promising method for generating high-resolution climate data and has significant implications for climate research and related applications.

The term Concept has been a prominent part of investigations in psychology and neurobiology where, mostly, it is mathematically or theoretically represented. The Concepts are also studied computationally through their symbolic, distributed and hybrid representations. The majority of these approaches focused on addressing concrete concepts notion, but the view of the abstract concept is rarely explored. Moreover, most computational approaches have a predefined structure or configurations. The proposed method, Regulated Activation Network (RAN), has an evolving topology and learns representations of Abstract Concepts by exploiting the geometrical view of Concepts, without supervision. In the article, the IRIS data was used to demonstrate: the RAN's modeling; flexibility in concept identifier choice; and deep hierarchy generation. Data from IoT's Human Activity Recognition problem is used to show automatic identification of alike classes as abstract concepts. The evaluation of RAN with 8 UCI benchmarks and the comparisons with 5 Machine Learning models establishes the RANs credibility as a classifier. The classification operation also proved the RAN's hypothesis of abstract concept representation. The experiments demonstrate the RANs ability to simulate psychological processes (like concept creation and learning) and carry out effective classification irrespective of training data size.

The relationship between Climate Change and Water is an obvious and key issue within the Sustainable Development Goals. This study aims to investigate the social representation created around this relationship in three different territorial contexts in order to evaluate the influence of the territory on the perception of the risk of Climate Change and its relationship with water. By means of a questionnaire completed by 1709 university students, the climatic literacy of the individual was evaluated in order to relate it to other dimensions on the relationship between Climate Change and Water (information, training previous on climate change and pro-environmental attitudes) in their different dimensions in three different territorial contexts. The results show that the socio-cultural context influences the social representation of Climate Change, but not from the climatological condition, so that it is reasonable to think that the social representation of this relationship is favoured by a common culture around this relationship.

Complexity science studies physical phenomena that cannot be explained by the mere analysis of the single units of a system but requires to account for their interactions. A feature of complexity in connected systems is the emergence of mesoscale patterns in a geometric space, such as groupings in bird flocks. These patterns are formed by groups of points that tend to separate from each other, creating mesoscale structures. When multidimensional data or complex networks are embedded in a geometric space, some mesoscale patterns can appear respectively as clusters or communities, and their geometric separability is a feature according to which the performance of an algorithm for network embedding can be evaluated. Here, we introduce a framework for the definition and measure of the geometric separability (linear and nonlinear) of mesoscale patterns by solving the travelling salesman problem (TSP), and we offer experimental evidence on embedding and visualization of multidimensional data or complex networks, which are generated artificially or are derived from real complex systems. For the first time in literature the TSP’s solution is used to define a criterion of nonlinear separability of points in a geometric space, hence redefining the separability problem in terms of the travelling salesman problem is an innovation which impacts both computer science and complexity theory.

In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k; 0 ≤ k ≤ n−1 or 1 ≤ k ≤ n, by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m = 5; 7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n^2m+1; m ≥ 0 as sum of row terms of corresponding triangle. In other words, in this manuscript are found and discussed the polynomials D_m(n,k) and U_m(n,k), such that, when being summed up over k in some range with respect to m and n returns the monomial n^2m+1.

An explanation of the origin of dark matter is suggested in this work. The argument is based on symmetry considerations about the concept of mass. In the Wigner's view, the rest mass and the spin of a free elementary particle in flat space-time are the two invariants that characterize the associated unitary irreducible representation of the Poincar\'e group. The Poincar\'e group has two and only two deformations with maximal symmetry. They describe respectively the de Sitter (dS) and Anti de Sitter (AdS) kinematic symmetries. Analogously to their shared flat space-time limit, two invariants, spin and energy scale for de Sitter and rest energy for Anti de Sitter, characterize the unitary irreducible representation associated with dS and AdS elementary systems. While the dS energy scale is a simple deformation of the Poincaré rest energy and so has a purely mass nature, AdS rest energy is the sum of a purely mass component and a kind of zero-point energy derived from the curvature. An analysis based on recent estimates on the chemical freeze-out temperature marking in Early Universe the phase transition quark-gluon plasma epoch to the hadron epoch supports the guess that dark matter energy might originate from an effective AdS curvature energy.

In this paper we provide some bounds for the error in approximating the Riemann-Stieltjes integral $\int_{a}^{b}f (t) du (t)$ by the generalized trapezoidal rule \begin{equation*} \left[ u\left( b\right) -u\left( x\right) \right] f\left( b\right) +\left[ u\left( x\right) -u\left( a\right) \right] f\left( a\right) \end{equation*} under various assumptions for the integrand $f$ and the integrator $u$ for which the above integral exists. Applications for continuous functions of selfadjoint operators and unitary operators in Hilbert spaces are provided as well.

For evaluating probabilities of arbitrary random events with respect to a given multivariate probability distribution, specific techniques are of great interest. An important two-dimensional high risk limit law is the Gauss-exponential distribution whose probabilities can be dealt with based upon the Gauss-Laplace law. The latter will be considered here as an element of the newly introduced family of (p,q)-spherical distributions. Based upon a suitably defined non-Euclidean arc-length measure on (p,q)-circles we prove geometric and stochastic representations of these distributions and correspondingly distributed random vectors, respectively. These representations allow dealing with the new probability measures similarly like with elliptically contoured distributions and more general homogeneous star-shaped ones. This is demonstrated at hand of a generalization of the Box-Muller simulation method. En passant, we prove an extension of the sector and circle number functions.

The purpose of the research is to investigate the unique solvability of a nonlocal boundary value problem for a loaded equation of parabolic-hyperbolic type in a special domain. Methods: Using representations of a general regular solution, the existence and uniqueness of the problem posed is proved. Results: A new method for proving the unique solvability of nonlocal boundary value problems for one loaded equation of mixed type in a special domain has been formed and developed. Conclusions: The obtained results make it possible to solve some problems of genetics, immunology, transonic gas dynamics and thermal physics, which are associated with displacement.

Despite the importance of few-shot learning, the lack of labeled training data in the real world, makes it extremely challenging for existing machine learning methods as this limited data set does not represent the data variance well. In this research, we suggest employing a generative approach using variational autoencoders (VAEs), which can be used specifically to optimize few-shot learning tasks by generating new samples with more intra-class variations. The purpose of our research is to increase the size of the training data set using various methods to improve the accuracy and robustness of the few-shot face recognition. Specifically, we employ the VAE generator to increase the size of the training data set, including the basic and the novel sets while utilizing transfer learning as the backend. Based on extensive experimental research, we analyze various data augmentation methods to observe how each method affects the accuracy of face recognition. We conclude that the face generation method we proposed can effectively improve the recognition accuracy rate to 96.47% using both the base and the novel sets.

A relationship between the functional Schr\"odinger representation and the precanonical quantization of a nonlinear scalar field theory is extended to arbitrary curved space-times. The canonical functional derivative Schr\"odinger equation is derived from the manifestly covariant precanonical Schr\"odinger equation in a singular limiting case when the ultraviolet parameter $\varkappa$ introduced by precanonical quantization is identified with the invariant delta-function at equal spatial points. In the same limiting case, the Schr\"odinger wave functional is expressed as the trace of the multidimensional product integral of Clifford-algebra-valued precanonical wave functions restricted to a certain field configuration. Thus the standard QFT in curved space-time in functional Schr\"odinger representation emerges from the precanonical formulation of quantum fields as a singular limiting case.

In the paper, the authors survey integral representations of the Catalan numbers and the Catalan–Qi function, discuss equivalent relations between these integral representations, supply alternative and new proofs of several integral representations, collect applications of some integral representations, and present sums of several power series whose coefficients involve the Catalan numbers.

Machine learning (ML) has found increasing use in research on energy conversion and storage technologies, in particular, so-called sustainable technologies. While often ML is used to directly optimize the parameters or phenomena of interest in the space of features, in this perspective, we focus on using ML to construct objects and methods that help in or enable the modeling of the underlying phenomena. We highlight the need for machine learning from very sparse and unevenly distributed numeric data in multidimensional spaces in these applications. After a brief introduction of some common regression-type machine learning techniques, we will focus on more advanced ML techniques which use these known methods as building blocks of more complex schemes and thereby allow working with extremely sparse data and also allow generating insight. Specifically, we will highlight the utility of using representations with sub-dimensional functions by combining the high-dimensional model representation ansatz with machine learning methods like neural networks or Gaussian process regressions in applications ranging from heterogeneous catalysis to nuclear energy.

What is the function of cognition? On one influential account, cognition evolved to co-ordinate behaviour with environmental change or complexity (Godfrey-Smith 1996). Liberal interpretations of this view ascribe cognition to an extraordinarily broad set of biological systems – even bacteria, which modulate their activity in response to salient external cues, would seem to qualify as cognitive agents. However, equating cognition with adaptive flexibility per se glosses over important distinctions in the way biological organisms deal with environmental complexity. Drawing on contemporary advances in theoretical biology and computational neuroscience, we cash these distinctions out in terms of different kinds of generative models, and the representational and uncertainty-resolving capacities they afford. This analysis leads us to propose a formal criterion for delineating cognition from other, more pervasive forms of adaptive plasticity. On this view, biological cognition is rooted in a particular kind of functional organisation; namely, that which enables the agent to detach from the present and engage in counterfactual (active) inference.

One of creators of quantum mechanics P. Jordan in his work on quantum biology claimed that life's missing laws were the rules of chance and probability of the quantum world. The article presents author’s results of studying frequencies (or probabilities) of nucleotides on so-called epi-chains of long DNA sequences of various eukaryotic and prokaryotic genomes. DNA epi-chains are algorithmically constructed subsequencies of DNA nucleotide sequences. According to the algorithm of construction of any epi-chain of the order n, the epi-chain is such nucleotide subsequence, in which the numerations of adjacent nucleotides differ by natural number n (n = 1, 2, 3, 4,…). Correspondingly each epi-chain of order n ≥ 2 contains n times less nucleotides than the original DNA sequence. The presented results unexpectedly discover that in long single-stranded and double-stranded DNA of any tested genome its DNA epi-chains of different orders n (values n are not too large) have practically identical frequencies (or probabilities) of each kind of nucleotides. These data allow considering DNA as a regular rich set of epi-chains, which can play a certain role in genetic and epigenetic phenomena as the author belives. Appropriate rules of nucleotide frequencies on epi-chains of long DNA sequences are formulated for further their tests on a wider set of genomes. These results testify on existence of long-range coherence in long DNA and remind the Fröhlich's theory of long-range coherence in biological systems. The phenomenological data are discussed from different standpoints: the DNA double helices and helical antennas with circular polarizations of electromagnetic waves; relations with the Fröhlich's theory; numerical analysis of DNA epi-chains under binary representations of nucleotides. Results are useful for developing quantum and algebraic biology.

This paper introduces an innovative theoretical framework for quantum-inspired data embeddings, grounded in foundational concepts of quantum mechanics such as superposition and entanglement. This approach aims to advance semi-supervised learning in contexts characterized by limited labeled data by enabling more intricate and expressive embeddings that capture the underlying structure of the data effectively. Grounded in foundational quantum mechanics concepts such as superposition and entanglement, this approach redefines data representation by enabling more intricate and expressive embeddings. Emulating quantum superposition encodes each data point as a probabilistic amalgamation of multiple feature states, facilitating a richer, multidimensional representation of underlying structures and patterns. Additionally, quantum-inspired entanglement mechanisms are harnessed to model intricate dependencies between labeled and unlabeled data, promoting enhanced knowledge transfer and structural inference within the learning paradigm. In contrast to conventional quantum machine learning methodologies that often rely on quantum hardware, this framework is fully realizable within classical computational architectures, thus bypassing the practical limitations of quantum hardware. The versatility of this model is illustrated through its application to critical domains such as medical diagnosis, resource-constrained natural language processing, and financial forecasting—areas where data scarcity impedes the efficacy of traditional models. Experimental evaluations reveal that quantum-inspired embeddings substantially outperform standard approaches, enhancing model resilience and generalization in high-dimensional, low-sample scenarios. This research marks a significant stride in integrating quantum theoretical principles with classical machine learning, broadening the scope of data representation and semi-supervised learning while circumventing the technological barriers of quantum computing infrastructure.

We propose a non-invasive approach to control the quality of spheroids and their fusion into a complex bioconstruct. The proposed method is based on the union of the nutrient concentration change calculated using Fick's law and the "reaction-diffusion" equations, taking into account absorption coefficient with specifying the exact fusion geometry using implicit Function Repre-sentation (FRep) functions. The proposed approach allows us to analyze the viability of cells within the spheroid, predict the fusion of spheroids, and accurately model complex heteroge-neous biostructures as a future task for our research. These results will significantly accelerate the development of such a promising field of additive biotechnologies as 3D bioprinting.

This paper examines the fundamental distinctions and complementary relationships between generative and descriptive methods in research and analysis. Through a systematic review of their applications across various fields, we explore how descriptive methods excel in capturing and characterizing existing phenomena, while generative methods enable the creation of new instances based on learned patterns. The analysis reveals that while these approaches serve different primary purposes, their integration often leads to more robust and comprehensive research outcomes. Our findings suggest that understanding the strengths and limitations of both methodologies is crucial for researchers and practitioners in choosing appropriate approaches for their specific contexts.

In this perspective article, we ponder topographical enhancements of artificial neural networks. In our recent paper in JMLR, we proved a quasi-equivalence between the network width and depth and also discussed the power of intra-links, which can be viewed as network height. In 1982, Hopfield published a network to model human associative memory, which contains many loops for dynamic evolution toward fixed points. Based on noising-denoising loops, diffusion models are recently developed to enable Bayesian modeling and inference with big data. Furthermore, we envision development of multi-AI-agent systems through “netware” engineering as a quantum leap of software engineering for emergent behaviors and autonomous AI at individual and population levels. We believe that the novel use of links and loops in space and time via multi-scale coupling would catalyze the next-generation neural networks.

Examining the similarity of event environments or surroundings, more precisely settings, provides additional insight in analyzing event sequences as it provides information about the context and potential common factors that may have influenced them. This article proposes a new similarity measure for event setting sequences, which involve the space and time in which events occur. While similarity measures for spatiotemporal event sequences have been studied, the settings and setting sequences have not yet been studied. While modeling event setting sequences we consider spatial and temporal scales to define the bounds of the setting and incorporates dynamic variables alongside static variables. Using a matrix-based representation and an extended Jaccard index we developed new similarity measures that allow for the use of all variable data types. We successfully used these similarity measures coupled with other multivariate statistical analysis approaches in a case study involving setting sequences and pollution event sequences associated with the same monitoring stations, which validate the hypothesis that more similar spatial-temporal settings or setting sequences may generate more similar events or event sequences. In conclusion, these similarity measures have many potential real-world applications, and offer researchers a powerful tool for understanding different factors and their dynamics corresponding to occurrences of spatiotemporal event sequences.

In this paper, some new properties of the fundamental solution to the multi-dimensional space- and time-fractional diffusion-wave equation are deduced. We start with the Mellin-Barnes representation of the fundamental solution that was derived in the previous publications of the author. The Mellin-Barnes integral is used to get two new representations of the fundamental solution in form of the Mellin convolution of the special functions of the Wright type. Moreover, some new closed form formulas for particular cases of the fundamental solution are derived. In particular, we solve an open problem of representation of the fundamental solution to the two-dimensional neutral-fractional diffusion-wave equation in terms of the known special functions.

In the paper, the authors establish two identities to express the generating function of the Chebyshev polynomials of the second kind and its higher order derivatives in terms of the generating function and its derivatives each other, deduce an explicit formula and an identities for the Chebyshev polynomials of the second kind, derive the inverse of an integer, unit, and lower triangular matrix, present several identities of the Catalan numbers, and give some remarks on the closely related results including connections of the Catalan numbers respectively with the Chebyshev polynomials, the central Delannoy numbers, and the Fibonacci polynomials.

Motivated by a common Mathematical Finance topic, this paper surveys several results concerning windings of 2-dimensional processes, including planar Brownian motion, complex-valued Ornstein-Uhlenbeck processes and planar stable processes. In particular, we present Spitzer's asymptotic Theorem for each case. We also relate this study to the pricing of Asian options.

Variational Auto-Encoders (VAEs) are deep generative models used for unsupervised learning, however their standard version is not topology-aware in practice since the data topology may not be taken into consideration. In this paper, we propose two different approaches with the aim to preserve the topological structure between the input space and the latent representation of a VAE. Firstly, we introduce InvMap-VAE as a way to turn any dimensionality reduction technique, given an embedding it produces, into a generative model within a VAE framework providing an inverse mapping into original space. Secondly, we propose the Witness Simplicial VAE as an extension of the Simplicial Auto-Encoder to the variational setup using a witness complex for computing the simplicial regularization, and we motivate this method theoretically using tools from algebraic topology. The Witness Simplicial VAE is independent of any dimensionality reduction technique and together with its extension, Isolandmarks Witness Simplicial VAE, preserves the persistent Betti numbers of a data set better than a standard VAE.

In 1969, Jean-Marie Souriau introduced a “Lie Groups Thermodynamics” in Statistical Mechanics in the framework of Geometric Mechanics. This Souriau’s model considers the statistical mechanics of dynamic systems in their "space of evolution" associated to a homogeneous symplectic manifold by a Lagrange 2-form, and defines in case of non null cohomology (non equivariance of the coadjoint action on the moment map with appearance of an additional cocyle) a Gibbs density (of maximum entropy) that is covariant under the action of dynamic groups of physics (eg, Galileo's group in classical physics). Souriau Lie Group Thermodynamics was also addressed 30 years after Souriau by R. F. Streater in the framework of Quantum Physics by Information Geometry for some Lie algebras, but only in the case of null cohomology. Souriau method could then be applied on Lie Groups to define a covariant maximum entropy density by Kirillov representation theory. We will illustrate this method for homogeneous Siegel domains and more especially for Poincaré unit disk by considering SU(1,1) group coadjoint orbit and by using its Souriau’s moment map. For this case, the coadjoint action on moment map is equivariant. For non-null cohomology, we give the case of Lie group SE(2). Finally, we will propose a new geometric definition of Entropy that could be built as a generalized Casimir invariant function in coadjoint representation, and Massieu characteristic function, dual of Entropy by Legendre transform, as a generalized Casimir invariant function in adjoint representation, where Souriau cocycle is a measure of the lack of equivariance of the moment mapping.

This paper offers a novel geometric and visual approach to the renowned Four Color Map Theorem and K5 non-planarity problem while unveiling their profound connection to the "kissing number" problem in 2D. We represent planar graphs through circles and tangents, simplifying complex structures and shedding light on these classic problems. Our proofs by contradiction, rooted in the kissing number concept, reveal that both the Four Color Map Theorem and K5 non-planarity are fundamentally linked, as they pivot around the concept of coloring. This study bridges the realms of geometry and graph theory, providing fresh insights and emphasizing the significance of the kissing number problem in various fields.

Perhaps the greatest challenge in the graft copolymerization of acrylic acid onto starch initiated by Fenton’s is the selectivity of the grafting reaction. Low selectivity means that too much of unwanted homopolymer polyacrylic acid is produced. In this paper, it has been analyzed why with this reaction system, involving a water soluble monomer and indirect initiation, the graft selectivity is such a challenge. Several other grafting reactions, especially with monomers of low water solubility or when direct initiation is applied, show a better grafting performance. A scheme is presented based on reaction engineering principles, that supports an explanation of the observed differences. A more selective activation of starch is a factor, but perhaps even more important is a low monomer to starch ratio at the starting sites of graft reactions. Based on these insights, several methods to improve the graft selectivity are evaluated, with the help of literature data but mostly by experimental explorations in our laboratory. Most promising appears to be a dedicated dosage method, to add monomer in portions over time, tested in a batch reactor with gelatinized cassava starch. This way, both grafting percentage and graft selectivity could be improved. Such could not be realized with the more conventional dosage, which is to add all monomer before the start of the reaction. This can be considered a principal breaktrough. Still, more research and development would be needed to refine the method and to implement the idea also in a continuous reactor at larger scale.

Let $f\left(1\right)=1$ , and let $f(n+1)=2^{2^{f\left(n\right)}}$ for every positive integer n. We consider the following hypothesis: if a system S ⊆ {x_i · x_j = x_k : i, j, k ∈ {1, . . . , n}} ∪ {x_i + 1 = x_k : i, k ∈{1, . . . , n}} has only finitely many solutions in non-negative integers x₁, . . . , x_n, then each such solution (x₁, . . . , x_n) satisfies x₁, . . . , x_n ≤ f (2n). We prove: (1) the hypothesisimplies that there exists an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the heights of integer (non-negative integer, positive integer, rational) solutions, if the solution set is finite; (2) the hypothesis implies that there exists an algorithm for listing the Diophantine equations with infinitely many solutions in non-negative integers; (3) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many rational solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has a rational solution; (4) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many integer solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; (5) the hypothesis implies that if a set $\mathfrak{M}$ ⊆ has a finite-fold Diophantine representation, then $\mathfrak{M}$ is computable.