Related papers: Distinguishing $\Bbbk$-configurations

A Lie-Hamilton system is a nonautonomous system of first-order ordinary differential equations describing the integral curves of a $t$-dependent vector field taking values in a finite-dimensional real Lie algebra of Hamiltonian vector…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

In a Hamiltonian system with first class constraints observables can be defined as elements of a quotient Poisson bracket algebra. In the gauge fixing method observables form a quotient Dirac bracket algebra. We show that these two algebras…

A \textit{distinguishing partition} of a group $X$ with automorphism group ${aut}(X)$ is a partition of $X$ that is fixed by no nontrivial element of ${aut}(X)$. In the event that $X$ is a complete multipartite graph with its automorphism…

We introduce multi-colour partition algebras $P_{n,m}(\delta_0, ..., \delta_{m-1})$, which are generalization of both bubble algebras and partition algebras, then define the bubble algebra $T_{n,m}(\delta_0, ..., \delta_{m-1})$ as a…

We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

This paper analyzes the structure of the set of positive solutions of a class of one-dimensional superlinear indefinite bvp's. It is a paradigm of how mathematical analysis aids the numerical study of a problem, whereas simultaneously its…

For all $k$, we construct a bijection between the set of sequences of non-negative integers ${\bf a}=(a_i)_{i\in{\bf Z}_{\geq0}}$ satisfying $a_i+a_{i+1}+a_{i+2}\leq k$ and the set of rigged partitions $(\lambda,\rho)$. Here…

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Positive integers with all digits equal are called repdigits. In this paper, we find all balancing and Lucas-balancing numbers, which can be expressed as the difference of two repdigits. The method of proof involves the application of…

Separable coordinate systems are introduced in the complex and real four-dimensional flat spaces. We use maximal Abelian subgroups to generate coordinate systems with a maximal number of ignorable variables. The results are presented (also…

We describe the structure of bimodules (over finite dimensional algebras) which have the property that the functor of tensoring with such a bimodule sends any module to a projective module. The main result is that all such bimodules are…

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…