Related papers: G-functions, motives, and unlikely intersections -…

We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…

Visual insights into a wide variety of statistical methods, for both didactic and data analytic purposes, can often be achieved through geometric diagrams and geometrically based statistical graphs. This paper extols and illustrates the…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

The neighborhood polynomial of graph $G$ is the generating function for the number of vertex subsets of $G$ of which the vertices have a common neighbor in $G$. In this paper, we investigate the behavior of this polynomial under several…

We consider Hilbert-type functions associated with difference (not necessarily inversive) field extensions and systems of algebraic difference equations in the case when the translations are assigned some integer weights. We will show that…

The goal of this paper is to raise the possibility that there exists a meaningful theory of `motives' associated to certain hypergeometric integrals, viewed as functions of their parameters. It goes beyond the classical theory of motives,…

In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…

Special functions have been used widely in many problems of applied sciences. However, there are considerable numbers of problems in which exact solutions could not be achieved because of undefined sums or integrals involving special…

We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…

Algebraic tools in statistics have recently been receiving special attention and a number of interactions between algebraic geometry and computational statistics have been rapidly developing. This paper presents another such connection,…

We study intersections of orbits in polynomial semigroup dynamics with lines on the affine plane over a number field, extending previous work of D. Ghioca, T. Tucker, M. Zieve (2008)

Lorenz values and the Gini index are popular quantities in Mathematical Economics, and are used here in the context of quantum systems with finite-dimensional Hilbert space. They quantify the uncertainty in the probability distribution…

In the research literature, one can find distinct notions for higher order averaged functions of regularly perturbed non-autonomous $T$- periodic differential equations of the kind $x'=\varepsilon F(t,x,\varepsilon)$. By one hand, the…

Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…

A survey of new geometric flows motivated by string theories is provided. Their settings can range from complex geometry to almost-complex geometry to symplectic geometry. From the PDE viewpoint, many of them can be viewed as intermediate…

We introduce and study a class of multivariate rational functions associated with hyperplane arrangements, called flag Hilbert-Poincar\'e series. These series are intimately connected with Igusa local zeta functions of products of linear…

A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different…