Related papers: Generic Generalized Diagonal Matrices
To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and momenta, and are always finite. They are generalised Feynman integrals which satisfy graphical…
We compute bilinear integrals involving Macdonald and Gegenbauer functions. These integrals are convergent only for a limited range of parameters. However, when one uses generalized integrals they can be computed essentially without…
Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…
We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in…
This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…
Four results are given that address the existence, ambiguities and construction of a classical R-matrix given a Lax pair. They enable the uniform construction of R-matrices in terms of any generalized inverse of $ad L$. For generic $L$ a…
One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this…
In this paper, we introduce generalized Gorenstein local (GGL) rings. The notion of GGL rings is a natural generalization of the notion of almost Gorenstein rings, which can thus be treated as part of the theory of GGL rings. For a…
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible $H-$matrices…
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…
Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…
There has recently been renewed recognition of the need to understand the consistency properties that must be preserved when a generalized matrix inverse is required. The most widely known generalized inverse, the Moore-Penrose…
Over an algebraically closed field of characteristic zero, we prove that the generic initial ideal with respect to the degree reverse lexicographic term order of a general rational or elliptic curve on quadrics is almost revlex. Following…
Let $UT_2$ be the algebra of $2\times 2$ upper triangular matrices over a field $F$ of characteristic zero. Here we study the generalized polynomial identities of $UT_2$, i.e., identical relations holding for $UT_2$ regarded as…
Let $\mathbb{F}_q$ be a field with $q$ elements. In this note, we study some generalized arcs, that is, sets of $\mathbb{F}_q$-points in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ such that no six of them are on a conic. First, we…
The generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many…
We study two-stage stochastic optimization models with mixed-integer decision variables appearing in both stages. For these models, dual decomposition enables parallel computing implementation and can quickly provide a lower bound for the…
We introduce and solve an infinite class of loop integrals which generalises the well-known ladder series. The integrals are described in terms of single-valued polylogarithmic functions which satisfy certain differential equations. The…
Generic spherical quadrilaterals are classified up to isometry. Condition of genericity consists in the requirement that the images of the sides under the developing map belong to four distinct circles which have no triple intersections.…
In generalized complex geometry, we revisit linear subspaces and submanifolds that have an induced generalized complex structure. We give an expression of the induced structure that allows us to deduce a smoothness criteria, we dualize the…