Related papers: Polynomial interpolation in higher dimension: from…
A new way of orthogonalizing ensembles of vectors by "lifting" them to higher dimensions is introduced. This method can potentially be utilized for solving quantum decision and computing problems.
We propose a novel theoretical framework for barycentric interpolation, using concepts recently developed in mathematical physics. Generalized barycentric coordinates are defined similarly to Shepard's method, using positive geometries -…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…
This is the same version that was previously only on my home page. We give a description of geometric realization which makes it evident that it commutes with products. A similar approach is used to treat cyclic sets. Our approach is…
Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…
In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension $d$ and order $h$ with a generic differential hypersurface of order $s$ is shown…
We study Maxim Kontsevich's graph complex $GC_d$ for any integer $d$ as well as its oriented and targeted versions, and show new short proofs of the theorems due to Thomas Willwacher and Marko Zivkovic which establish isomorphisms of their…
The enumeration of combinatorial classes of the complex polynomial vector fields in C presented in [Dia13] is extended here to a closed form enumeration of combinatorial classes for degree d polynomial vector fields up to rotations of…
We present a new construction of gradient-like vector fields in the setting of Morse theory on a complex analytic stratification. We prove that the ascending and descending sets for these vector fields possess cell decompositions satisfying…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
We apply a notion of geodesics of plurisubharmonic functions to interpolation of compact subsets of $C^n$. Namely, two non-pluripolar, polynomially closed, compact subsets of $C^n$ are interpolated as level sets $L_t=\{z: u_t(z)=-1\}$ for…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
We compute the decomposition of representations of Yangians into g-modules for simply-laced Lie algebras g. The decomposition has an interesting combinatorial tree structure. Results depend on a conjecture of Kirillov and Reshetikhin.
We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…
We extend to a scheme-theoretic context the notion of a combinatorial differential form, due to A.Kock in the framework of synthetic differential geometry. We show that group-valued combinatorial forms on a scheme may be identified, under…
We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…