Related papers: Total dual dyadicness and dyadic generating sets

An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…

Let $A$ be a set of $N$ vectors in ${\mathbb Z}^n$ and let $v$ be a vector in ${\mathbb C}^N$ that has minimal negative support for $A$. Such a vector $v$ gives rise to a formal series solution of the $A$-hypergeometric system with…

Let $G$ be a graph. A set $S \subseteq V(G)$ is independent if its elements are pairwise non-adjacent. A vertex $v \in V(G)$ is shedding if for every independent set $S \subseteq V(G) \setminus N[v]$ there exists $u \in N(v)$ such that $S…

For a graph $G=(V,E)$, a set $D\subseteq V$ is called a \emph{disjunctive dominating set} of $G$ if for every vertex $v\in V\setminus D$, $v$ is either adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it.…

For a primal-dual pair of conic linear problems that are described by convex cones $S\subset X$, $T\subset Y$, bilinear symmetric objective functions $\langle\cdot,\cdot\rangle_X$, $\langle\cdot,\cdot\rangle_Y$ and a linear operator…

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

In this paper we discuss symmetrically self-dual spaces, which are simply real vector spaces with a symmetric bilinear form. Certain subsets of the space will be called q-positive, where q is the quadratic form induced by the original…

The "linear dual" of a cocomplete linear category $\mathcal C$ is the category of all cocontinuous linear functors $\mathcal C \to \mathrm{Vect}$. We study the questions of when a cocomplete linear category is reflexive (equivalent to its…

Let $(H, \a)$ be a monoidal Hom-Hopf algebra and $(A, \b)$ a right $(H, \a)$-Hom-comodule algebra. We first investigate the criterion for the existence of a total integral of $(A, \b)$ in the setting of monoidal Hom-Hopf algebras. Also we…

It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.

We introduce the $h$-adic quantum vertex algebras associated with the rational $R$-matrix in types $B$, $C$ and $D$, thus generalizing the Etingof--Kazhdan's construction in type $A$. Next, we construct the algebraically independent…

Some of the most common mathematical models in biology, chemistry, physics, and engineering, are polynomial dynamical systems, i.e., systems of differential equations with polynomial right-hand sides. Inspired by notions and results that…

We discuss the problem of classifying polynomials $p : \mathbb R^2_+ \rightarrow (0, \infty)$ for which $\frac{1}{p}=\{\frac{1}{p(m, n)}\}_{m, n \geq 0}$ is joint completely monotone, where $p$ is a linear polynomial in $y.$ We show that if…

Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…

Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

We study the behavior of canonical height functions $\widehat{h}_f$, associated to rational maps $f$, on totally $p$-adic fields. In particular, we prove that there is a gap between zero and the next smallest value of $\widehat{h}_f$ on the…

In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…