Related papers: Unique path partitions: Characterization and Congr…

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…

Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…

The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…

We consider sequences counting integer partitions in two colors (red and blue) in which the even parts occur only in blue color. We focus on subsequences defined by constraints on the parity and color of the summands. We establish formulas…

We show that many theorems which assert that two kinds of partitions of the same integer $n$ are equinumerous are actually special cases of a much stronger form of equality. We show that in fact there correspond partition statistics $X$ and…

The path integral formulation introduced in [arXiv:2210.12761] "Path integrals, particular kinds, and strange things" by Friston and colleagues in 2023, offers an innovative lens for examining complex systems, particularly through its…

The independence equivalence class of a graph $G$ is the set of graphs that have the same independence polynomial as $G$. A graph whose independence equivalence class contains only itself, up to isomorphism, is independence unique. Beaton,…

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

We present several constructions of paths and processes with finite quadratic variation along a refining sequence of partitions, extending previous constructions to the non-uniform case. We study in particular the dependence of quadratic…

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

In this note, we will give a short proof of an identity for cubic partitions.

The perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters. Such a tree exists precisely when an intersection graph associated…

All components of complements of discriminant varieties of simple real function singularities are explicitly listed. New invariants of such components (for not necessarily simple singularities) are introduced. A combinatorial algorithm…

We show how to construct path integrals for quantum mechanical systems where the space of configurations is a general non-compact symmetric space. Associated with this path integral is a perturbation theory which respects the global…

We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…

Characterizations of paracompact finite $C$-spaces via continuous selections are given. We apply these results to obtain some properties of finite $C$-spaces. Factorization theorems and a completion theorem for finite $C$- spaces are also…

We introduce a new feature map for barcodes that arise in persistent homology computation. The main idea is to first realize each barcode as a path in a convenient vector space, and to then compute its path signature which takes values in…

We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…

We introduce the notions of tree-like path and tree-like equivalence between paths and prove that the latter is an equivalence relation for paths of finite length. We show that the equivalence classes form a group with some similarity to a…