Related papers: Convex-Cyclic Matrices, Convex-Polynomial Interpol…
In this chapter we review concepts and theories of polymer dynamics. We think of it as an introduction to the topic for scientists specializing in other subfields of statistical mechanics and condensed matter theory, so, for the readers…
Given a quiver associated to a cluster algebra and a sequence of vertices, iterative mutation leads to $F$-Polynomials which appear in numerous places in the cluster algebraic literature. The coefficients of the monomials in these…
We characterize the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems as the solution of an infinite-dimensional linear programming problem. For systems with polynomial dynamics and…
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of…
$2\times2$ matrix polynomials of the form $P_{n}(z)= \Sigma^{n}_{j=0}\,\sigma_{j}\,z^{j}$, for the cases $n=1,2,3$ are constructed, and the nature of PT-symmetry is examined across different points $z=(x,y)$ in the complex plane. The…
We relate the construction of a complete set of cyclic mutually unbiased bases, i. e., mutually unbiased bases generated by a single unitary operator, in power-of-two dimensions to the problem of finding a symmetric matrix over F_2 with an…
By introducing a generalized notion of multiple zeta values associated with an arbitrary finite subset $S\subset \mathbb{P}^1(\mathbb{C})$ and studying their transformation properties under rational functions, we show that multiple…
We propose a new description of Endofunctors of Module Categories, based upon a combinatorial category comprising finite sets and so-called mazes. Polynomial and numerical functors both find a natural interpretation in this frame-work.…
Classical Gon\v{c}arov polynomials are polynomials which interpolate derivatives. Delta Gon\v{c}arov polynomials are polynomials which interpolate delta operators, e.g., forward and backward difference operators. We extend fundamental…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
Dyadic rationals are rationals whose denominator is a power of $2$. We define dyadic $n$-dimensional convex sets as the intersections with $n$-dimensional dyadic space of an $n$-dimensional real convex set. Such a dyadic convex set is said…
We investigate the notion of cyclicity for convolutional codes as it has been introduced by Piret and Roos in the seventies. Codes of this type are described as submodules of the module of all vector polynomials in one variable with some…
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…
This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…