相关论文: The algebra of balanced dessins
Let $S$ be a set of $r$ red points and $b=r+2d$ blue points in general position in the plane, with $d\geq 0$. A line $\ell$ determined by them is said to be balanced if in each open half-plane bounded by $\ell$ the difference between the…
The purpose of this paper is to find an explicit formula and asymptotic estimate for the total number of sum of weighted records over set partitions of $[n]$ in terms of Bell numbers. For that we study the generating function for the number…
Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…
This is a survey on stated skein algebras and their representations.
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…
By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…
The concept of integro-differential algebra has been introduced recently in the study of boundary problems of differential equations. We generalize this concept to that of integro-differential algebra with a weight, in analogy to the…
An algebraic structure related to discrete zero curvature equations is established. It is used to give an approach for generating master symmetries of first degree for systems of discrete evolution equations and an answer to why there exist…
In this paper, a construction of an infinite dimensional associative algebra, which will be called a \emph{Surface Algebra}, is associated in a "canonical" way to a dessin d'enfant, or more generally, a cellularly embedded graph in a…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…
Motivated by two identities published with Ramanujan's lost notebook and connected, respectively, with the Gauss circle problem and the Dirichlet divisor problem, in an earlier paper, three of the present authors derived representations for…
A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete…
Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…
Almost designs ($t$-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike $t$-designs, it is not clear whether $t$-adesigns need also be $(t-1)$-designs…
In La G\'eom\'etrie, Descartes proposed a balance between geometric constructions and symbolic manipulation with the introduction of suitable ideal machines. In modern terms, that is a balance between analog and symbolic computation.…