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

The Chow group of zero cycles in the moduli space of stable pointed curves of genus zero is isomorphic to the integer additive group. Let $M$ be monomial in this Chow group. If no two factors of $M$ fulfill a particular quadratic relation,…

We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…

We prove new necessary and sufficient conditions for a morphism of coalgebras to be a monomorphism, different from the ones already available in the literature. More precisely, $\phi: C \to D$ is a monomorphism of coalgebras if and only if…

Given finite posets $P$ and $Q$, we consider a specific ideal $L(P,Q)$, whose minimal monomial generators correspond to order-preserving maps $\phi:P\rightarrow Q$. We study algebraic invariants of those ideals. In particular, sharp lower…

Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…

Let $D$ denote a positive integer and let $Q_D$ denote the graph of the $D$-dimensional hypercube. Let $X$ denote the vertex set of $Q_D$ and let $A \in \MX$ denote the adjacency matrix of $Q_D$. A matrix $B \in \MX$ is called $A$-{\em…

Understanding when two non-isomorphic graphs can have the same spectra is a classic problem that is still not completely understood, even for integral circulant graphs. We say that a natural number $N$ satisfies the \emph{integral spectral…

An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

The niche graph of a digraph $D$ is the (simple undirected) graph which has the same vertex set as $D$ and has an edge between two distinct vertices $x$ and $y$ if and only if $N^+_D(x) \cap N^+_D(y) \neq \emptyset$ or $N^-_D(x) \cap…

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\sum_{A} x^{|A|}$, summed over…

Let $\Bbb F_q$ be a finite field with $\text{char}\,\Bbb F_q=p$ and $n>0$ an integer with $\text{gcd}(n, \log_pq)=1$. Let $(\ )^*:\Bbb F_q({\tt x}_0,\dots,{\tt x}_{n-1})\to\Bbb F_q({\tt x}_0,\dots,{\tt x}_{n-1})$ be the $\Bbb…

Let $q=p^e$, where $p$ is a prime and $e\geq 1$ is an integer. For $m\geq 1$, let $P$ and $L$ be two copies of the $(m+1)$-dimensional vector spaces over the finite field $\mathbb{F}_q$. Consider the bipartite graph $W_m(q)$ with partite…

Let $E$ and $E'$ be 2-isogenous elliptic curves over $\Q$. Following \cite{ck}, we call a good prime $p$ \emph{anomalous} if $E(\F_p) \simeq E'(\F_p)$ but $E(\F_{p^2}) \not \simeq E'(\F_{p^2})$. Our main result is an explicit formula for…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order…

Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…