Related papers: Representations and characterizations of polynomia…
We discuss representations of monogenic functions over very regular groups.
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…
A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form…
In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way…
A characteristic function is a special operator-valued analytic function defined on the open unit ball of $\mathbb{C}^n$ associated with an $n$-tuple of commuting row contraction on some Hilbert space. In this paper, we continue our study…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…
We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
In this paper, we introduce new concepts of domination and packing functions in graphs, which generalize, respectively, the labelled dominating and packing functions defined by Lee and Chang in 2008, and Hinrichsen et al. in 2019. These…
The general solution of the two-dimensional integrable generalization of the f-Toda chain with fixed ends is explicitly presented in terms of matrix elements of various fundamental representations of the SL(n|n-1) supergroup. The dominant…
In this paper we consider generalized monomial functions $f, g\colon \mathbb{F}\to \mathbb{C}$ (of possibly different degree) that also fulfill \[ f(P(x))= Q(g(x)) \qquad \left(x\in \mathbb{F}\right), \] where $P\in \mathbb{F}[x]$ and $Q\in…
For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…
The purpose of these notes is to introduce some of the problems the enumeration of lattice walks is dedicated to and familiarize with some of the arguments they can be addressed with. We discuss the enumeration of lattice walks, their…
A lattice gauge theory with an action polynomial in independent field variables is considered. The link variables are described by unconstrained complex matrices instead of unitary ones. A mechanism which permits to switch off in the…
We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…
In this chapter are given necessary and sufficient conditions for the regularity of solutions of the functional equation appearing in the theory of classical orthogonal polynomials. In addition, we also present the functional Rodrigues…