相关论文: An AP-Structure with Finslerian Flavor: Path Equat…

We show that any pointed, preordered module map $\mathfrak{BF}_{\mathrm{gr}}(E) \to \mathfrak{BF}_{\mathrm{gr}}(F)$ between Bowen-Franks modules of finite graphs can be lifted to a unital, graded, diagonal preserving $\ast$-homomorphism…

The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…

Fractal geometry and analysis constitute a growing field, with numerous applications, based on the principles of fractional calculus. Fractals sets are highly effective in improving convex inequalities and their generalisations. In this…

Here, a non-linear analysis method is applied rather than classical one to study projective Finsler geometry. More intuitively, by means of an inequality on Ricci-Finsler curvature, a projectively invariant pseudo-distance is introduced and…

This paper introduces a novel steepest descent flow in Banach spaces. This extends previous works on generalized gradient descent, notably the work of Charpiat et al., to the setting of Finsler metrics. Such a generalized gradient allows…

The space of anisotropic $r$-contravariant $s$-covariant $\alpha$-homogeneous tensors on a manifold admits a functorial structure where vertical derivatives $\dot{\partial}$ and contractions $\imath_{\mathbb{C}}$ by the Liouville vector…

Using a geometry wider than Riemannian one, the parameterized absolute parallelism (PAP-) geometry, we derived a new curve containing two parameters. In the context of the geometrization philosophy, this new curve can be used as a…

Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including…

Field equations for n-frames h_a{}^\mu that are possible in the theory of absolute parallelism (AP) are considered. The methods of compatibility (or formal integrability) theory enable us to find the non-Lagrangian equation having unusual…

Heaps of pieces were introduced by Viennot and have applications to algebraic combinatorics, theoretical computer science and statistical physics. In this paper, we how certain combinatorial properties of heaps studied by Fan and by…

The port-Hamiltonian formulation is a powerful method for modeling and interconnecting systems of different natures. In this paper, the port-Hamiltonian formulation in tensorial form of a thick plate described by the Mindlin-Reissner model…

As a natural application of the {\it theory of geometric averaging} in Finsler geometry and generalized Finsler geometry, a new approach to investigate {\it generalized Finsler geometry}, based on a convex invariance of the average…

Motivated in part by the bi-gravity approach to massive gravity, we introduce and study the multimetric Finsler geometry. For the case of an arbitrary number of dimensions, we study some general properties of the geometry in terms of its…

In this paper, linear systems with a crisp real coefficient matrix and with a vector of fuzzy triangular numbers on the right-hand side are studied. A new method, which is based on the geometric representations of linear transformations, is…

Finslerian extension of the theory of relativity implies that space-time can be not only in an amorphous state which is described by Riemann geometry but also in ordered, i.e. crystalline states which are described by Finsler geometry.…

When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could decide whether a Hamiltonian path exists for a fixed starting…

We consider the problem of finding a Hamiltonian path with precedence constraints in the form of a partial order on the vertex set. This problem is known as Partially Ordered Hamiltonian Path Problem (POHPP). Here, we study the complexity…

In 1929, Paul Funk and Ludwig Berwald gave a characterization of Hilbert geometries from the Finslerian viewpoint. They showed that a smooth Finsler metric in a convex bounded domain of $\mathbb{R}^n$ is the Hilbert geometry in that domain…

Some general Finsler connections are defined. Emphasis is being made on the Cartan tensor and its derivatives. Vanishing of the hv-curvature tensors of these connections characterizes Landsbergian, Berwaldian as well as Riemannian…

A systematic development of the so-called Palatini formalism is carried out for pseudo-Finsler metrics $L$ of any signature. Substituting in the classical Einstein-Hilbert-Palatini functional the scalar curvature by the Finslerian Ricci…