Related papers: Enumeration and classification of self-orthogonal …
We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local rule of diameter $d$ over an alphabet of $q$ elements…
While there has been significant progress on algorithmic aspects of the Lov\'{a}sz Local Lemma (LLL) in recent years, a noteworthy exception is when the LLL is used in the context of random permutations. The breakthrough algorithm of Moser…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
There exists a bijection between the set of Latin squares of order $n$ and the set of feasible solutions of the 3-dimensional planar assignment problem ($3PAP_n$). In this paper, we prove that, given a Latin square isotopism $\Theta$, we…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
Let $A$ be a $r\times r$ rational nonzero symmetric matrix, $B$ a rational column vector, $C$ a rational scalar. For any integer lattice $L$ and vector $v$ of $\mathbb{Z}^r$, we define Nahm sum on the lattice coset $v+L\in \mathbb{Z}^r/L$:…
Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials, via the definition of convexity, its first order characterization, and its second order…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
Consider a partial Latin square $P$ where the first two rows and first three columns are completely filled, and every other cell of $P$ is empty. It has been conjectured that all such partial Latin squares of order at least $8$ are…
We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…
We consider the problem of exhaustively visiting all pairs of linear cellular automata which give rise to orthogonal Latin squares, i.e., linear Orthogonal Cellular Automata (OCA). The problem is equivalent to enumerating all pairs of…
Singular vectors of a representation of a finite-dimensional simple Lie algebra are weight vectors in the underlying module that are nullified by positive root vectors. In this article, we use partial differential equations to find all the…
The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…
There are several questions one may ask about polynomials $q_m(x)=q_m(x;t)=\sum_{n=0}^mt^mp_n(x)$ attached to a family of orthogonal polynomials $\{p_n(x)\}_{n\ge0}$. In this note we draw attention to the naturalness of this partial-sum…
An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…
In this paper we deal with the calculation of the signed (total) Roman domination numbers, $\gamma_{sR}$ and $\gamma_{stR}$ respectively, on a few classes of planar graphs from the literature. We give proofs for the exact values of the…
We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…
For each irreducible module of the symmetric group $\mathcal{S}_{N}$ there is a set of parametrized nonsymmetric Jack polynomials in $N$ variables taking values in the module. These polynomials are simultaneous eigenfunctions of a…
For each irreducible module of the symmetric group on $N$ objects there is a set of parametrized nonsymmetric Jack polynomials in $N$ variables taking values in the module. These polynomials are simultaneous eigenfunctions of a commutative…
We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable…