Related papers: Legendre $G$-array pairs and the theoretical unifi…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erd\H{o}s, Faudree, Rousseau, and Schelp: Ramsey-finiteness is preserved by adjoining…
Scientific paper is devoted to establish connection of T-matrix - matrix of composite numbers 6h+1 v 6h-1 in special view - with Legendre's conjecture.
For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching. There is extensive literature…
For an arbitrary proper DG algebra A (i.e. DG algebra with finite dimensional total cohomology) we introduce a pairing on the Hochschild homology of A and present an explicit formula for a Chern-type character of an arbitrary perfect…
We study and solve several problems in two closely related settings: set families in $2^{[n]}$ with many disjoint pairs of sets and low rank matrices with many zero entries. - More than 40 years ago, Daykin and Erd\H{o}s asked for the…
This is a short survey about the theory of stable polynomials and its applications. It gives self-contained proofs of two theorems of Schrijver. One of them asserts that for a $d$--regular bipartite graph $G$ on $2n$ vertices, the number of…
We establish new couplings among several random graph and multigraph models related to the random regular graph $G(n,d)$, including the configuration model and unions of random perfect matchings. As a main result, we verify the…
We consider the problem whether for a group G there exists a constant Lambda(G) > 1 such that for any (r,s)-matrix A over the integral group ring ZG the Fuglede-Kadison determinant of the G-equivariant bounded operator from L^2(G)^r to…
A linking pairing is a symetric bilinear pairing lambda: GxG --> Q/Z on a finite abelian group. The set of isomorphism classes of linking pairings is a non-cancellative monoid E under orthogonal sum, which is infinitely generated and…
We investigate pairs $(G,Y)$, where $G$ is a reductive algebraic group and $Y$ a purely-odd $G$-superscheme, asking when a pair corresponds to a quasi-reductive algebraic supergroup $\mathbb{G}$, that is, $\mathbb{G}_{\text{ev}}$ is…
We give an algebra-combinatorial constructions of (noncommutative) generating functions of double Schubert and double $\beta$-Grothendieck polynomials corresponding to the full flag varieties associated to the Lie groups of classical types…
In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
A perfect matching of a complete graph $K_{2n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $\mathcal{F}$ is family of intersecting perfect matchings of…
Let $m_G$ denote the number of perfect matchings of the graph $G$. We introduce a number of combinatorial tools for determining the parity of $m_G$ and giving a lower bound on the power of 2 dividing $m_G$. In particular, we introduce…
The primary goal of this paper is to explicitly write down all semisimple dual pairs in the exceptional Lie algebras. (A dual pair in a reductive Lie algebra $\mathfrak{g}$ is a pair of subalgebras such that each member equals the other's…
Bi-incomplete Tambara functors over a group $G$ can be understood in terms of compatible pairs of $G$-transfer systems. In the case of $G = C_{p^n}$ , Hill, Meng and Li gave a necessary and sufficient condition for compatibility and…
We provide combinatorial rules to compute Kazhdan--Lusztig polynomials for the Hermitian symmetric pair $(B_N,A_{N-1})$ when the Hecke algebra has unequal parameters. They are obtained by filling regions delimited by paths with ballot…
A matching $M$ of a graph $G$ is maximal if it is not a proper subset of any other matching in $G$. Maximal matchings are much less known and researched than their maximum and perfect counterparts. In particular, almost nothing is known…