Related papers: Flows on Simplicial Complexes
The simplest flux compactifications are highly symmetric---a $q$-form flux is wrapped uniformly around an extra-dimensional $q$-sphere. In this paper, we investigate solutions that break the internal SO($q+1$) symmetry down to…
If ${\cal F}$ is a set of subgraphs $F$ of a finite graph $E$ we define a graph-counting polynomial $$ p_{\cal F}(z)=\sum_{F\in{\cal F}}z^{|F|} $$ In the present note we consider oriented graphs and discuss some cases where ${\cal F}$…
Let $\Phi$ be an irreducible (possibly noncrystallographic) root system of rank $l$ of type $P$. For the corresponding cluster complex $\Delta(P)$, which is known as pure $(l-1)$-dimensional simplicial complex, we define the generating…
Let $G$ be a bridgeless cubic graph, and $\mu_2(G)$ the minimum number $k$ such that two 1-factors of $G$ intersect in $k$ edges. A cyclically $n$-edge-connected cubic graph $G$ has a nowhere-zero 5-flow if (1) $n \geq 6$ and $\mu_2(G) \leq…
Hamiltonian flows on compact surfaces are characterized, and the topological invariants of such flows with finitely many singular points are constructed from the viewpoints of integrable systems, fluid mechanics, and dynamical systems.…
A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…
Two rational functions $f,g\in\Bbb F_q(X)$ are said to be {\em equivalent} if there exist $\phi,\psi\in\Bbb F_q(X)$ of degree one such that $g=\phi\circ f\circ\psi$. We give an explicit formula for the number of equivalence classes of…
For a monic polynomial $Q_n$ of degree $n$, let $Q_{n, k}$ be its $k$-th derivative normalized to be monic. Under the only assumption that the sequence $\{Q_n\}$ has a weak* limiting zero distribution (an empirical distribution of zeros)…
A complex polynomial $P(z) = c_0 + c_1 z +...+ c_n z^n$ is called unimodular if $|c_j| = 1$, $j = 0,...,n$. Littlewood asked the question (1966) on how close a unimodular polynomial come to satisfying $|P(z)| \approx \sqrt{n+1}$ if $n \ge…
We study the pluripolar hull of the graph of a holomorphic function f, defined on a domain D in the complex plane outside a polar set A of D. This leads to a theorem that describes under what conditions f is nowhere extendable over A, while…
A triangle-path in a graph $G$ is a sequence of distinct triangles $T_1,T_2,\ldots,T_m$ in $G$ such that for any $i, j$ with $1\leq i < j \leq m$, $|E(T_i)\cap E(T_{i+1})|=1$ and $E(T_i)\cap E(T_j)=\emptyset$ if $j > i+1$. A connected graph…
As an absolute invariant of smooth conjugacy, the multiplier group described the types of space-time symmetries that the flow has, and for a quasiperiodic flow on the $n$-torus, is the determining factor of the structure of its generalized…
Recently, a $q$-polynomial approach to the construction and analysis of cyclic codes over $\gf(q)$ was given by Ding and Ling. The objective of this paper is to give another $q$-polynomial approach to all cyclic codes over $\gf(q)$.
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at…
The series $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$ converges for $|q|<1$ and defines a {\em partial theta function}. For any fixed $q\in (0,1)$ it has infinitely many negative zeros. It is known that for $q$ taking one of the…
In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…
We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the same conclusion holds under the weaker hypothesis that…
An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in an actual flow, some flow excess, which does not exceed…
In this note we study some of the properties of the generating polynomial for homomorphisms from a graph to at complete weighted graph on $q$ vertices. We discuss how this polynomial relates to a long list of other well known graph…
We provide a framework for relating certain q-series defined by sums over partitions to multiple zeta values. In particular, we introduce a space of polynomial functions on partitions for which the associated q-series are q-analogues of…