Related papers: A Note on the Isomorphism Problem for Monomial Dig…

In this paper, we consider a variant of dichromatic number on digraphs with prescribed sets of arcs. Let $D$ be a digraph and let $Z_1, Z_2$ be two sets of arcs in $D$. For a subdigraph $H$ of $D$, let $A(H)$ denote the set of all arcs of…

Among other results, we prove that if $I$ is a monomial ideal of $S=K[x_1,\ldots,x_n]$, where $K$ is a field, and $a\geq b-1\geq0$ are integers such that $a+b\leq\mathrm{proj~dim}(S/I)$, then $$t_{a+b}\leq…

Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,x) is called the domination root of G. It is…

We define a certain merging operation that given two $d$-polytopes $P$ and $Q$ such that $P$ has a simplex facet $F$ and $Q$ has a simple vertex $v$ produces a new $d$-polytope $P\hspace{0.1em}\triangleright Q$ with $f_0(P)+f_0(Q)-(d+1)$…

For a pair $(P,Q)$ of finite posets the generators of the ideal $L(P,Q)$ correspond bijectively to the isotone maps from $P$ to $Q$. In this note we determine all pairs $(P,Q)$ for which the Alexander dual of $L(P,Q)$ coincides with…

A description is given of those sequences ${\Bbb S}= (S(0),S(1),\dots,S(l))$ of simple modules over a finite dimensional algebra for which there are only finitely many uniserial modules with consecutive composition factors…

If a finite group $G$ is isomorphic to a subgroup of $SO(3)$, then $G$ has the D2-property. Let $X$ be a finite complex satisfying Wall's D2-conditions. If $\pi_1(X)=G$ is finite, and $\chi(X) \geq 1-Def(G)$, then $X \vee S^2$ is simple…

Let D be a divisor in a complex analytic manifold X. A natural problem is to determine when the de Rham complex of meromorphic forms on X with poles along D is quasi-isomorphic to its subcomplex of logarithmic forms. In this mostly…

Let $k,p,q$ be three positive integers. A graph $G$ with order $n$ is said to be $k$-placeable if there are $k$ edge disjoint copies of $G$ in the complete graph on $n$ vertices. A $(p,\,q)$-graph is a graph of order $p$ with $q$ edges.…

A digraph $D$ is called {\bf noneven} if it is possible to assign weights of 0,1 to its arcs so that $D$ contains no cycle of even weight. A noneven digraph $D$ corresponds to one or more nonsingular sign patterns. Given an $n \times n$…

Suppose given a Frobenius category E, i.e. an exact category with a big enough subcategory B of bijectives. Let_E_ := E/B denote its classical stable category. For example, we may take E to be the category of complexes C(A) with entries in…

In this paper, we give formulas for $v$-number of edge ideals of some graphs like path, cycle, 1-clique sum of a path and a cycle, 1-clique sum of two cycles and join of two graphs. For an $\mathfrak{m}$-primary monomial ideal $I\subset…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

Let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over a division ring $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency, ${\mathbb{D}}^{m\times n}$ is a…

Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 10$ other than a directed cycle. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$ dominates a vertex $z$ if $x\rightarrow z$ and $y\rightarrow z$; in this…

We study proper holomorphic maps between type-$\mathrm{I}$ irreducible bounded symmetric domains. In particular, we obtain rigidity results for such maps under certain assumptions. More precisely, let $f:D^{\mathrm{I}}_{p,q}\to…

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…

For a finite set A of integral vectors, Gel'fand, Kapranov and Zelevinskii defined a system of differential equations with a parameter vector as a D-module, which system is called an A-hypergeometric (or a GKZ hypergeometric) system.…