Related papers: Polynomial interpolation in higher dimension: from…

The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd$(v,n)>1$. It is remarkable that all the known difference sets with…

This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to…

The aim of the paper is to extend the class of generalized Weyl algebras to a larger class of rings (they are also called {\em generalized Weyl algebras}) that are determined by two ring endomorphisms rather than one as in the case of `old'…

For modular indecomposable representations of a cyclic group $G$ of prime order $p$ we propose a list of polynomial invariants of degree $\leq 3$ that, together with a simple invariant of degree $p$, separate generic orbits and generate the…

We propose a generalization of the factorization method to the case when $\mathcal{G}$ is a finite dimensional Lie algebra such that $\mathcal{G}=\mathcal{G}_0\oplus M \oplus N$ (direct sum of vector spaces), where $\mathcal{G}_0$ is a…

In this article, we introduce the simplicial $d$-polytopic numbers defined on generalized Fibonacci polynomials. We establish basic identities and find $q$-identities known. Furthermore, we find generating functions for the simplicial…

We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k=s_1+s_2, s_i\in S; such sets are called Sidon sets if g=2 and generalized Sidon sets if g\ge 3. We extend to generalized…

We look at generalized complex structures from the point of view of Poisson and Dirac geometry and we remark that the puzzling equations underlying the notion of generalized complex structure have miraculously simple meaning when passing to…

Letting $P$ be a convex polytope in $\mathbb{R}^d$ with $n>d$ vertices, we study geometric and analytical properties of the set of generalized barycentric coordinates relative to any point $p\in P$. We prove that such sets are polytopes in…

The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

Let $G(n)={\rm Sp}(n,1)$ or ${\rm SU}(n,1)$. We classify conjugation orbits of generic pairs of loxodromic elements in $G(n)$. Such pairs, called `non-singular', were introduced by Gongopadhyay and Parsad for ${\rm SU}(3,1)$. We extend this…

Hanika, Schneider, and Stumme introduced geometric data set as a generalization of metric measure space for the computation of the observable diameter, and extended the observable distance between metric measure spaces to that between…

Generalized Cluster Algebras (GCA) are generalizations of Cluster Algebras (CA) with higher-order exchange relations. Previously, Chekhov-Shapiro conjectured that every GCA can be embedded into a CA. In this paper, we prove a modified…

In a fascinating recent American Mathematical Monthly article, Norman Wildberger and Dean Rubine introduced a new kind of combinatorial numbers, that they aptly named the ``Geode numbers''. While their definition is simple, these numbers…

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

A generalization of the filled-in Julia set is presented using the multicomplex numbers and an algorithm is presented to visualize these sets in the tridimensional space. There are many ways to visualize these higher dimensional fractals…

For a graph $G = (V,E)$ and a subset $R \subseteq V$, we say that $R$ is \textit{multiset resolving} for $G$ if for every pair of vertices $v,w$, the \textit{multisets} $\{d(v,r): r \in R\}$ and $\{d(w,r):r \in R\}$ are distinct, where…

M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…