组合数学

The star chromatic number on a graph is the minimum number of colors in a proper vertex coloring forbidding any $P_4$ with two colors (bicolored). This problem was introduced by Gr\"unbaum (1973) together with the acyclic coloring of…

We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…

Let $W$ be an irreducible Weyl group and $W_a$ its affine Weyl group. In a previous work the author introduced an affine variety $\widehat{X}_{W_a}$, called the Shi variety of $W_a$, whose integral points are in bijection with $W_a$. The…

The relevance of this paper lies in the fact that it resolves two previously unsolved open problems. In the first part of the paper, a new lemma is proved, from which it follows that if there exists a triangle with integer sides and…

We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the…

In combinatorial representation theory, Kostant's weight multiplicity formula $m(\lambda,\mu)$ is a tool that provides a means of determining the multiplicity of a weight $\mu$ in the adjoint representation of a simple Lie algebra…

We define and study a continuous version of 2-frieze patterns, a combinatorial structure closely related with frieze patterns of Coxeter and Conway. We describe the relation of continuous 2-friezes with the moduli space of projective curves…

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…

We consider the incidence structure formed by the twelve pentagons given by the vertex neighborhoods of the icosahedron. Interpreting this structure purely in terms of coplanarity conditions, we show that -- up to projective equivalence --…

Given a finite group $G$, the \emph{Prime Order Element (POE) Graph} $\Gamma(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough…

The undirected zero divisor graph of a commutative ring with unity \( R \), denoted by \( \Gamma(R) = (V(\Gamma(R)), E(\Gamma(R))) \). The vertex set \( V(\Gamma(R)) \) consists of all the non-zero zero-divisors of \( R \). The edge set \(…

The induced Ramsey number $r_{\mathrm{ind}}(G,H)$ is defined as the minimum order of a graph $F$ on such that any 2-coloring of its edges with red and blue leads to either a red induced copy of $G$ or a blue induced copy of $H$. Motivated…

Graph energy has been widely investigated in spectral graph theory. However, the manner in which this energy is distributed among individual vertices has received attention only more recently, following the introduction of energy of a…

In 1919, Ramanujan discovered his famous congruences for the partition function. Not too long after, Freeman Dyson conjectured a combinatorial statistic existed that explained the three congruences, which he dubbed the \textit{crank}. A…

In this manuscript we lift the theory of r-quasisymmetric functions to the theory of Hopf monoids. We provide a general method of interpolating between two Hopf monoids, one being the free monoid on a positive comonoid and the other being…

In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate…

Discrete differential equations appear most prominently in planar map and lattice path enumeration. In this work we consider discrete differential equations with an additional parameter $x$, where the order of the equation is $1$ for $x=0$…

We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of…

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $r$-graph on $n$ vertices in which every $k$ edges span more than $s$ vertices. Brown, Erd\H{o}s and S\'{o}s in 1973 conjectured that for every $k\geq 2$, the limit…

We prove a universal identity for powers of elements in quadratic algebras, expressing x^m in terms of x and the identity. As a consequence, we obtain a general formula for powers of 2x2 matrices depending only on trace and determinant.…