相关论文: Alternating Sign Pentagons and Magog Pentagons

Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…

On signed social networks, balanced and unbalanced triangles are a critical motif due to their role as the foundations of Structural Balance Theory. The uses for these motifs have been extensively explored in networks with known edge signs,…

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

Recent interest in noncircular trigonometric proofs has underscored the need for alternative methodologies. Jackson and Johnson's 2024 study addresses a longstanding gap in the foundations of trigonometric proofs. Inspired by the work of…

We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex. For outerplanar graphs $G$ with faces of arbitrary…

Let $A_n\subseteq S_n$ denote the alternating and the symmetric groups on $1,...,n$. MacMahaon's theorem, about the equi-distribution of the length and the major indices in $S_n$, has received far reaching refinements and generalizations,…

To any $n \times n$ Latin square $L$, we may associate a unique sequence of mutually orthogonal permutation matrices $P = P_1, P_2, ..., P_n$ such that $L = L(P) = \sum kP_k$. Brualdi and Dahl (2018) described a generalisation of a Latin…

In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an $n$-vertex planar graph. They precisely determined the maximum number of triangles and $4$-cycles and presented a conjecture…

Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

There are fifteen edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^3b^2$: five one-parameter families of pentagonal subdivision tilings, and ten flip modifications of three special cases of two…

A conjecture proposed by J. Tripp in 2002 states that the crossing number of any knot coincides with the canonical genus of its Whitehead double. In the meantime, it has been established that this conjecture is true for a large class of…

We give constructions to realize an odd number, which is representable as sum of two squares, as determinant of an achiral knot, thus proving that these are exactly the numbers occurring as such determinants. Later we study which numbers…

The number of Monotone Triangles with bottom row k1 < k2 < ... < kn is given by a polynomial alpha(n; k1,...,kn) in n variables. The evaluation of this polynomial at weakly decreasing sequences k1 >= k2 >= ... >= kn turns out to be…

Recently, alternating twist multilayer graphene (ATMG) has emerged as a family of moir\'e systems that share several fundamental properties with twisted bilayer graphene, and are expected to host similarly strong electron-electron…

We consider a pentagon chain described by a Hubbard type of model considered under periodic boundary conditions. The system i) is placed in an external magnetic field perpendicular to the plane of the cells, and ii) is in a site selective…

In [F] H. Furusho proves the beautiful result that of the three defining equations for associators, the pentagon implies the two hexagons (see also [W]). In this note we present a simpler proof for this theorem (although our paper is less…

We show that the number of monotone triangles with prescribed bottom row (k_1,...,k_n) is given by a simple product formula which remarkably involves (shift) operators. Monotone triangles with bottom row (1,2,...,n) are in bijection with $n…

Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under…

Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common bases of two matrices. Generalizing these two examples,…