Related papers: Codes on graphs: Duality and MacWilliams identitie…
In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
Split decomposition of graphs was introduced by Cunningham (under the name join decomposition) as a generalization of the modular decomposition. This paper undertakes an investigation into the algorithmic properties of split decomposition.…
Graphs are general and powerful data representations which can model complex real-world phenomena, ranging from chemical compounds to social networks; however, effective feature extraction from graphs is not a trivial task, and much work…
Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition…
In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…
For the rational Baker-Akhiezer functions associated with special arrangements of hyperplanes with multiplicities we establish an integral identity, which may be viewed as a generalisation of the self-duality property of the usual Gaussian…
Andrews and Keith recently produced a general Schmidt type partition theorem using a novel interpretation of Stockhofe's bijection, which they used to find new $q$-series identities. This includes an identity for a trivariate 2-colored…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most \(1\) chip on each…
We define parametrized cobordism categories and study their formal properties as bivariant theories. Bivariant transformations to a strongly excisive bivariant theory give rise to characteristic classes of smooth bundles with strong…
Using basic hypergeometric functions and partial fraction decomposition we give a new kind of generalization of identities due to Uchimura, Dilcher, Van Hamme, Prodinger, and Chen-Fu related to divisor functions. An identity relating…
We consider a pure U(1) quantum gauge field theory on a general Riemannian compact four manifold. We compute the partition function with Abelian Wilson loop insertions. We find its duality covariance properties and derive topological…
An exposition on Spivakovsky's dual graphs of valuations on function fields of dimension two is first given, leading to a proof of minimal generating sequences for the non-divisorial valuations. It should be noted that the definition of…
An old idea in optimization theory says that since the gradient is a dual vector it may not be subtracted from the weights without first being mapped to the primal space where the weights reside. We take this idea seriously in this paper…
In the past decade, several multi-resolution representation theories for graph signals have been proposed. Bipartite filter-banks stand out as the most natural extension of time domain filter-banks, in part because perfect reconstruction,…