Related papers: New constructions for the $n$-queens problem

This paper considers the problem of efficiently answering reachability queries over views of provenance graphs, derived from executions of workflows that may include recursion. Such views include composite modules and model fine-grained…

We introduce a family of matrix dilogarithms, which are automorphisms of C^N tensor C^N, N being any odd positive integer, associated to hyperbolic ideal tetrahedra equipped with an additional decoration. The matrix dilogarithms satisfy…

We initiate the study of computational problems on $k$-mers (strings of length $k$) in labeled graphs. As a starting point, we consider the problem of counting the number of distinct $k$-mers found on the walks of a graph. We establish that…

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…

A scheme of computing $\chi(\mbar_{1,n}, L_1^{\otimes d_1}\otimes ... \otimes L_n^{\otimes d_n})$ is given. Here $\mbar_{1,n}$ is the moduli space of $n$-pointed stable curves of genus one and $L_i$ are the universal cotangent line bundles…

A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set of non-negative integers and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow…

We prove a formula for the ${\mathbb S}_n$-equivariant Euler characteristic of the moduli space of graphs $\mathcal{MG}_{g,n}$. Moreover, we prove that the rational ${\mathbb S}_n$-invariant cohomology of $\mathcal{MG}_{g,n}$ stabilizes for…

The problem of subgraph counting asks for the number of occurrences of a pattern graph $H$ as a subgraph of a host graph $G$ and is known to be computationally challenging: it is $\#W[1]$-hard even when $H$ is restricted to simple…

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same…

In 2010, V. Futorny and S. Ovsienko gave a realization of $U(\mathfrak{gl}_n)$ as a subalgebra of the ring of invariants of a certain noncommutative ring with respect to the action of $S_1\times S_2\times\cdots\times S_n$, where $S_j$ is…

In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. A list assignment to $G$ is an assignment $L = \{L(v)\}_{v\in V…

A moduli space of stable quotients of the rank n trivial sheaf on stable curves is introduced. Over nonsingular curves, the moduli space is Grothendieck's Quot scheme. Over nodal curves, a relative construction is made to keep the torsion…

We define the logarithmic tautological rings of the moduli spaces of Deligne-Mumford stable curves (together with a set of additive generators lifting the decorated strata classes of the standard tautological rings). While these algebras…

We present in this short note a polynomial graph extension procedure that can be used to improve any graph isomorphism algorithm. This construction propagates new constraints from the isomorphism constraints of the input graphs (denoted by…

In 2007, G.E. Andrews introduced the $(n+1)$-variable combinatorial generating function $R_n(x_1,x_2,\cdots,x_n;q)$ for ranks of $n$-marked Durfee symbols, an $(n+1)$-dimensional multisum, as a vast generalization to the ordinary…

A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow \mathcal{P}(X)-\{\emptyset\}$…

In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \notin A(D)$, then $D$ has a directed $2$-factor with exactly…

Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…

Let $G = (V,E)$ be a connected simple graph of order $p$ and size $q$. A graph $G$ is called local antimagic if $G$ admits a local antimagic labeling. A bijection $f : E \to \{1,2,\ldots,q\}$ is called a local antimagic labeling of $G$ if…