相关论文: Grassmannian trilogarithms
We give the first genuine 2-variable functional equation for the 7--logarithm. We investigate and relate identities for the 3-logarithm given by Goncharov and Wojtkowiak and deduce a certain family of functional equations for the…
The paper presents a systematic construction of primitive Pythagorean triples. The order of enumeration on the set of primitive Pythagorean triples is defined. The order is based on the representation of a primitive Pythagorean triple by…
Lax operator algebras for the root system $G_2$, and arbitrary finite genus Riemann surfaces and Tyurin data on them are constructed.
We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…
Multiple polylogarithms are equipped with rich algebraic structures including the motivic coaction and the single-valued map which both found fruitful applications in high-energy physics. In recent work arXiv:2312.00697, the current authors…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
We develop a new approach to the study of the functional equations satisfied by classical polylogarithms, inspired by Goncharov's conjectures. We prove a sharpened version of Zagier's criterion for such an equation and explain, how our…
The induced subgraph of the corresponding Grassmann graph formed by simplex codes is considered. We show that this graph, as the Grassmann graph, contains two types of maximal cliques. For any two cliques of the first type there is a…
We use the methods of empirical mathematics to show that iterative logarithmic operations will result in an attractor point on the complex plane. Moreover, we demonstrate that different bases converge onto different attractors. Finally, we…
Classical polylogarithms give rise to a variation of mixed Hodge-Tate structures on the punctured projective line $S=\mathbb{P}^1\setminus \{0, 1, \infty\}$, which is an extension of the symmetric power of the Kummer variation by a trivial…
Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.
In this paper we examine a procedure that, on starting with an integer $n$, results in a pair of equal integers that are no greater than $n$. We call the resulting value the \textit{strange root} of $n$ and we show how this…
Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…
We propose hypergeometric constructions of simultaneous approximations to polylogarithms. These approximations suit for computing the values of polylogarithms and satisfy 4-term Apery-like (polynomial) recursions.
A Gr\"obner basis for the ideal determining mod 2 cohomology of Grassmannian G_{3,n} is obtained. This is used, along with the method of obstruction theory, to establish some new immersion results for these manifolds.
I discuss a simple numerical algorithm for the direct evaluation of multiple Grassmann integrals. The approach is exact, suffers no Fermion sign problems, and allows arbitrarily complicated interactions. Memory requirements grow…
This works deals with the formal mathematical structure of so called Grassmann Numbers applied to Theoretical Physics, which is a basic concept on Berezin integration. To achieve this purpose we make use of some constructions from relative…
We present a review of the symbol map, a mathematical tool that can be useful in simplifying expressions among multiple polylogarithms, and recall its main properties. A recipe is given for how to obtain the symbol of a multiple…
We establish that the sequences formed by logarithms and by "fractional" powers of integers, as well as the sequence of prime numbers, are non-holonomic, thereby answering three open problems of Gerhold [Electronic Journal of Combinatorics…
Codes in the Grassmannian space have found recently application in network coding. Representation of $k$-dimensional subspaces of $\F_q^n$ has generally an essential role in solving coding problems in the Grassmannian, and in particular in…