English
Related papers

Related papers: P-Polynomial and Bipartite Coherent Configurations

200 papers

In this note, we extend the definition of $p$-biharmonic and bi-$p$-harmonic maps between two Riemannian manifolds and explore some of their properties.

Differential Geometry · Mathematics 2026-03-09 Fethi Latti , Ahmed Mohammed Cherif

We construct a set $M_d$ whose points parametrize families of Meixner polynomials in $d$ variables. There is a natural bispectral involution $b$ on $M_d$ which corresponds to a symmetry between the variables and the degree indices of the…

Classical Analysis and ODEs · Mathematics 2012-05-25 Plamen Iliev

The article presents an algebra to represent two dimensional patterns using reciprocals of polynomials. Such a representation will be useful in neural network training and it provides a method of training patterns that is much more…

Information Theory · Computer Science 2011-02-23 Subhash Kak

We continue our study of topological partial *-algebras, focusing our attention to *-semisimple partial *-algebras, that is, those that possess a {multiplication core} and sufficiently many *-representations. We discuss the respective roles…

Rings and Algebras · Mathematics 2012-10-12 J-P. Antoine , G. Bellomonte , C. Trapani

We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…

Combinatorics · Mathematics 2011-06-08 Adam Bohn

It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs is open. In this paper, we first show that the Partial Vertex Cover…

Computational Complexity · Computer Science 2013-04-23 Bugra Caskurlu , K. Subramani

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

Computational Complexity · Computer Science 2020-11-17 Balagopal Komarath , Anurag Pandey , C. S. Rahul

A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…

Quantum Algebra · Mathematics 2012-10-09 Hans Plesner Jakobsen , Hechun Zhang

Let $G$ be a finite group and let $H_1,H_2<G$ be two subgroups. In this paper, we are concerned with the bipartite graph whose vertices are $G/H_1\cup G/H_2$ and a coset $g_1H_1$ is connected with another coset $g_2H_2$ if and only if…

Group Theory · Mathematics 2022-08-25 Péter P. Varjú

The space of subvarieties of P^n with a fixed Hilbert polynomial is not complete. Grothendieck defined a completion by relaxing "variety" to "scheme", giving the complete_Hilbert scheme_ of subschemes of P^n with fixed Hilbert polynomial.…

Algebraic Geometry · Mathematics 2010-05-02 Valery Alexeev , Allen Knutson

Let $G$ be a graph and $A$ the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\mathrm{per}(xI-A)$. In this paper some of the results from a numerical study of the permanental polynomials of graphs are presented.…

Combinatorics · Mathematics 2015-01-29 Shunyi Liu , Jinjun Ren

Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…

Representation Theory · Mathematics 2012-02-17 David M. Riley , Mark C. Wilson

A bipartite biregular $(n,m;g)$-graph $G$ is a bipartite graph of even girth $g$ having the degree set $\{n,m\}$ and satisfying the additional property that the vertices in the same partite set have the same degree. An $(n,m;g)$-bipartite…

Combinatorics · Mathematics 2019-07-29 Gabriela Araujo-Pardo , Alejandra Ramos-Rivera , Robert Jajcay

We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…

Category Theory · Mathematics 2026-02-10 Ivan Kuzmin , Chad Nester , Ülo Reimaa , Sam Speight

The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…

Discrete Mathematics · Computer Science 2023-12-29 Yuri Faenza , Luca Ferrarini

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Combinatorics · Mathematics 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

A topological invariant of a polynomial map $p:X\to B$ from a complex surface containing a curve $C\subset X$ to a one-dimensional base is given by a rational second homology class in the compactification of the moduli space of genus $g$…

Algebraic Geometry · Mathematics 2007-05-23 Paul Norbury

We present a general unified approach for finding the coherent states of polynomially deformed algebras such as the quadratic and Higgs algebras, which are relevant for various multiphoton processes in quantum optics. We give a general…

Quantum Physics · Physics 2007-05-23 V. SunilKumar , B. A. Bambah , R. Jagannathan , P. K. Panigrahi , V. Srinivasan

The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be partitioned into sets $A$ and $B$, where $A$ is an independent set and $B$ induces a forest. The set $A$ in such a partition is said to be an…

Data Structures and Algorithms · Computer Science 2017-08-01 Marthe Bonamy , Konrad K. Dabrowski , Carl Feghali , Matthew Johnson , Daniel Paulusma

We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…

Mathematical Physics · Physics 2015-06-05 E Celeghini , Mariano A del Olmo