Related papers: Combinatorial minors for matrix functions and thei…
The maximal minors of a matrix of indeterminates are a universal Gr\"obner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental…
We formulate a coherent approach to signals and systems theory on time scales. The two derivatives from the time-scale calculus are used, i.e., nabla (forward) and delta (backward), and the corresponding eigenfunctions, the so-called nabla…
In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized…
We define combinatorial counterparts to the geometric string vertices of Sen-Zwiebach and Costello-Zwiebach, which are certain closed subsets of the moduli spaces of curves. Our combinatorial vertices contain the same information as the…
In this work, we analyze the combinatorial properties of cylinders and subdivisions of augmented semi-simplicial sets. These constructions are obtained as particular cases of a certain action from a co-semi-simplicial set on an augmented…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…
We examine the groundstate wavefunction of the rotor model for different boundary conditions. Three conjectures are made on the appearance of numbers enumerating alternating sign matrices. In addition to those occurring in the O($n=1$)…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
The inversion of nabla Laplace transform, corresponding to a causal sequence, is considered. Two classical methods, i.e., residual calculation method and partial fraction method are developed to perform the inverse nabla Laplace transform.…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…
We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…
Given a pair $A,B$ of matrices of size $n\times n$, we consider the matrix function $e^{At+B}$ of the variable $t\in\mathbb{C}$. If the matrix $A$ is Hermitian, the matrix function $e^{At+B}$ is representable as the bilateral Laplace…
Recent innovations on the differential calculus for functions of non-commuting variables, begun for a quaternionic variable, are now extended to the case of a general matrix over the complex numbers. The expansion of F(X+Delta) is given to…
We focus upon the relationship between Hamiltonian cycle products and efficient vectors for a reciprocal matrix $A$, to more deeply understand the latter. This facilitates a new description of the set of efficient vectors (as a union of…
We will show that the number of integers $\leq x$ that can be written as the square of an integer plus the square of a prime equals $\frac{\pi}{2} \cdot \frac {x}{\log x}$ minus a secondary term of size $x/(\log x)^{ 1+\delta+o(1)}$, where…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
In this work, we study the discrete observables $$E_k = \sum_{i,j=1}^n (i-j)^k A_{i,j}$$ associated with $n\times n$ alternating sign matrices $A = (A_{i,j})$. This work develops exact formulas for expectations using Bernoulli polynomials,…
A permanental vector is a generalization of a vector with components that are squares of the components of a Gaussian vector, in the sense that the matrix that appears in the Laplace transform of the vector of Gaussian squares is not…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…