相关论文: Grassmannian trilogarithms

We express the Aomoto trilogarithm explicitely via classical trilogarithm and investigate the algebraic-geometric structures behind this: different realuzations of the weight three motivic complexes. Using this results we give an explicit…

We give a simple explicit construction of the Grassmannian n-logarithm, which is a multivalued analytic function on the quotient of the Grassmannian of generic n-dimensional subspaces in 2n-dimensional coordinate complex vector space by the…

For a field $F$ and a given integer $n>1$, Goncharov has given a complex $\Gamma_F(n)$ which he calls motivic and which he expects to rationally compute the weight $n$ motivic cohomology of $\text{Spec }F$, and hence its algebraic…

In this paper we want to introduce two commutative diagrams for weight $n$=2 and $n$=3 with six faces on each. These diagrams describe the relations between Grassmannian complex in geometric configurations, Bloch-Suslin's complex for weight…

We compute a lower bound for the number of simplices that are needed to triangulate the Grassmann manifold $G_k(\mathbb{R}^n)$. In particular, we show that the number of top-dimensional simplices grows exponentially with $n$. More precise…

We will pursue a way of building up an algebraic structure that involves, in a mathematical abstract way, the well known Grassmann variables. The problem arises when we tried to understand the grassmannian polynomial expansion on the scope…

We give new explicit formulas for Grassmannian and Aomoto polylogarithms in terms of iterated integrals, for arbitrary weight. We also explicitly reduce the Grassmannian polylogarithm in weight 4 and in weight 5 each to depth 2.…

The construction of Grassmannian codes in some projective space is of highly mathematical nature and requires strong computational power for the resulting searches. In this paper was constructed, using GAP System for Computational Discrete…

For an integer n>2 we define a polylogarithm, which is a holomorphic function on the universal abelian cover of C-{0,1} defined modulo (2 pi i)^n/(n-1)!. We use the formal properties of its functional relations to define groups lifting…

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

We consider polygon and simplex equations, of which the simplest nontrivial examples are pentagon (5-gon) and Yang--Baxter (2-simplex), respectively. We examine the general structure of (2n+1)-gon and 2n-simplex equations in direct sums of…

We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…

We build generalizations of the Grassmann algebras from a few simple assumptions which are that they are graded, maximally symmetric and contain an ordinary Grassmann algebra as a subalgebra. These algebras are graded by Z_{n}^{3} and…

On the Grassmann manifold G (m, n) of m-dimensional subspaces of an n-dimensional projective space P^n, a certain supplementary construction called the normalization is considered. By means of this normalization, one can construct the…

Feynman integrals are very often computed from their differential equations. It is not uncommon that the $\varepsilon$-factorised differential equation contains only dlog-forms with algebraic arguments, where the algebraic part is given by…

In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Elimination algorithm and Minimal Element Elimination algorithm. The…

We prove an estimate on the number of rational points on the Grassmannian variety of bounded twisted height, refining the classical results of Schmidt ([12]) and Thunder ([20]) over the rational field: most importantly, our formula counts…

Following the ideas of Bossinger and Fang, Fourier, and Littelman, we study iterated sequences for the Grassmannian $\operatorname{Gr} (3, n)$ as a special class of birational sequences. For each iterated sequence $S$, there is a weighting…

We express a general multiple polylogarithm of weight n as an explicit linear combination of multiple polylogarithms of weight n in n-2 variables. We express a general multiple polylogarithm of weight 4 as an explicit linear combination of…

The Grassmannian space $\Gr$ is the set of all $k-$dimensional subspaces of the vector space~\smash{$\F_q^n$}. Recently, codes in the Grassmannian have found an application in network coding. The main goal of this paper is to present…