Related papers: Distinguishing $\Bbbk$-configurations
We prove a criterion for $k-$formality of arrangements, using a complex constructed from vector spaces introduced in \cite{bt}. As an application, we give a simple description of $k-$formality of graphic arrangements: Let $G$ be a connected…
Let $M(n,d)$ be the maximum size of a permutation array on $n$ symbols with pairwise Hamming distance at least $d$. Some permutation arrays can be constructed using blocks of certain type [2] called product blocks in this paper. We study…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our…
Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge…
For a given bundle $\xi \colon E \to M$ over a manifold, configuration-section spaces on $\xi$ parametrise finite subsets $z \subseteq M$ equipped with a section of $\xi$ defined on $M \smallsetminus z$, with prescribed "charge" in a…
A localization theorem for the cyclotomic rational Cherednik algebra $H_c=H_c((\mathbb{Z}/l)^n\rtimes \mathfrak{S}_n)$ over a field of positive characteristic has been proved by Bezrukavnikov, Finkelberg and Ginzburg. Localizations with…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear…
Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…
We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…
A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple…
The symplectic blob algebra $b_n$ ($n \in \mathbb{N}$) is a finite dimensional algebra defined by a multiplication rule on a basis of certain diagrams. The rank $r(n)$ of $b_n$ is not known in general, but $r(n)/n$ grows unboundedly with…
Given a fat point scheme $\mathbb{W}=m_1P_1+\cdots+m_sP_s$ in the projective $n$-space $\mathbb{P}^n$ over a field $K$ of characteristic zero, the modules of K\"ahler differential $k$-forms of its homogeneous coordinate ring contain useful…
In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and…
The ability to compute the exact divergence between two high-dimensional distributions is useful in many applications but doing so naively is intractable. Computing the alpha-beta divergence -- a family of divergences that includes the…
We describe the eventual behaviour of the Hilbert function of a set of distinct points in P^{n_1} x ... x P^{n_k}. As a consequence of this result, we show that the Hilbert function of a set of points in P^{n_1} x ... x P^{n_k} can be…
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…