Related papers: Matrix convex verbatim enumeration functions are g…
A convolution approach leading to an explicit computation of a value of a 4F3 function is outlined. We also investigate about the role of the dilogarithm reflection formula, leading to a remarkable consequence: in some cases, values of 4F3…
Convex analysis and Gaussian probability are tightly connected, as mostly evident in the theory of linear regression. Our work introduces an algebraic perspective on such relationship, in the form of a diagrammatic calculus of string…
We analyze matrix convex functions of a fixed order defined on a real interval by differential methods as opposed to the characterization in terms of divided differences given by Kraus. We obtain for each order conditions for matrix…
This study focuses on convex functions and their generalized. Thus, we start this study by giving the definition of convex functions and some of their properties and discussing a simple geometric property. Then we generalize E-convex…
We study counting functions of planar polygons arising from homological mirror symmetry of elliptic curves. We first analyze the signature and rationality of the quadratic forms corresponding to the signed areas of planar polygons. Then we…
We present applications of rectangular matrix models to various combinatorial problems, among which the enumeration of face-bicolored graphs with prescribed vertex degrees, and vertex-tricolored triangulations. We also mention possible…
In this article, we further explore convex functions by revealing new bounds, resulting from stronger convexity behavior. In particular, we define the so called radical convex functions and study their properties. We will see that such…
We study several-matrix models and show that when the potential is convex and a small perturbation of the Gaussian potential, the first order correction to the free energy can be expressed as a generating function for the enumeration of…
An upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We study these words from the combinatorial point of view,…
The logarithmic convexity of restrictions of the Beta functions to rays parallel to the main diagonal and the functional equation \[ \phi\left( x+1\right) =\frac{x\left( x+k\right) }{\left( 2x+k+1\right) \left( 2x+k\right) }\phi\left(…
Quantum 3D R-matrix in the classical (i.e. functional) limit gives a symplectic map of dynamical variables. The corresponding 3D evolution model is considered. An auxiliary problem for it is a system of linear equations playing the role of…
We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…
The topics of Convexity and Concavity and Envelopes are central in Complex Analysis and extensively investigated. The aim of this paper is to find a possible counterpart in Algebraic Geometry. The article presents preliminary results on…
Subaddivity type matrix inequalities for concave funcions and symetric norms are given.
We give a combinatorial interpretation for the hypergeometric functions associated with tuples of rational numbers.
Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of…
Polyconvexity is an important concept in the analysis of energies related to elasticity. A function $f \colon \R^{d\times d} \to \R$ is called polyconvex if it can be written as a convex function in the minors of the argument. We show that…
The Linguistic Matrix Theory programme introduced by Kartsaklis, Ramgoolam and Sadrzadeh is an approach to the statistics of matrices that are generated in type-driven distributional semantics, based on permutation invariant polynomial…
An analysis of the characteristic function of Gaussian quadratic forms is presented in [1] to study the performance of multichannel communication systems. This technical report reviews this analysis, obtaining alternative expressions to…
A convex envelope for the problem of finding the best approximation to a given matrix with a prescribed rank is constructed. This convex envelope allows the usage of traditional optimization techniques when additional constraints are added…