Related papers: Polynomial interpolation in higher dimension: from…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
In this paper, we consider a two-parameter polynomial generalization, denoted by G_{a,b}(n,k;r), of the r-Lah numbers which reduces to these recently introduced numbers when a=b=1. We present several identities for G_{a,b}(n,k;r) that…
In this article, we introduce the adapted inverse iteration method to generate bicomplex Julia sets associated to the polynomial map $w^2+c$. The result is based on a full characterization of bicomplex Julia sets as the boundary of a…
In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…
We introduce a family of generalizations of the pentagram maps related to $Q$-nets. A specific example is considered, and we find the map can be treated as a refactorization mapping in the Poisson-Lie group of pseudo-difference operators.…
The notion of Poincare gauge manifold ($G$), proposed in the context of an (1+1) gravitational theory by Cangemi and Jackiw (D. Cangemi and R. Jackiw, Ann. Phys. (N.Y.) 225 (1993) 229), is explored from a geometrical point of view. First…
We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields.
The theory of designs is an important branch of combinatorial mathematics. It is well-known in the theory of designs that a finite subset of a sphere is a tight spherical 1-design if and only if it is a pair of antipodal points. On the…
We introduced previously the generalized characteristic polynomial defined by $P_C(\lambda)={\rm det}\,C(\lambda),$ where $C(\lambda)=C+{\rm diag}\big(\lambda_1,\dots,\lambda_n\big)$ for $C\in {\rm Mat}(n,\mathbb C)$ and…
Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
We generalise the construction of $Q$-family of quandles and $G$-family of quandles which were introduced in the paper of A. Ishii, M. Iwakiri, Y. Jang, K. Oshiro, and find connection with other constructions of quandles. We define a…
The paper contains a survey of the results obtained by the author in recent years. These results concern the application in multivariate polynomial interpolation of some geometric constructions and methods. In particular, we give estimates…
We show that there exists a simple generalization of Kazakov's multicritical one-matrix model, which interpolates between the various multicritical points of the model. The associated multicritical potential takes the form of a power series…
We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the…
We study the correlated equilibrium polytope $P_G$ of a game $G$ from a combinatorial point of view. We introduce the region of full-dimensionality for this class of polytopes and prove that it is a semialgebraic set for any game. Using a…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…