相关论文: A new labeling construction from the $\otimes_h$-p…

A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given.…

The Kronecker product is an invaluable tool for data-sparse representations of large networks and matrices with countless applications in machine learning, graph theory and numerical linear algebra. In some instances, the sparsity pattern…

We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name…

We give a new construction of tensor product gamma factors for a pair of irreducible representations of $\operatorname{GL}_c\left(\mathbb{F}_q\right)$ and $\operatorname{GL}_k\left(\mathbb{F}_q\right)$. This construction is a finite field…

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

We propose a new approach to temporal inference, inspired by the Pearlian causal inference paradigm - though quite different from Pearl's approach formally. Rather than using directed acyclic graphs, we make use of factored sets, which are…

We give a new definition for the crossed-product of a C*-algebra A by a *-endomorphism \alpha, which depends not only on the pair (A,\alpha) but also on the choice of a transfer operator (defined in the paper). With this we generalize some…

We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags…

The generalized hierarchical product of graphs was introduced by L. Barri\'ere et al in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster…

We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…

Algorithmic classifications of research publications can be used to study many different aspects of the science system, such as the organization of science into fields, the growth of fields, interdisciplinarity, and emerging topics. How to…

We present an integral representation for the tensor product $L$-function of a pair of automorphic cuspidal representations, one of a classical group, the other of a general linear group. Our construction is uniform over all classical…

For a family of compact Riemann surfaces X_t of genus g>1 parametrized by the Schottky space S_g, we define a natural basis for the holomorphic n-differentials on X_t which varies holomorphically with t and generalizes the basis of…

Massive power-law graphs drive many fields: metagenomics, brain mapping, Internet-of-things, cybersecurity, and sparse machine learning. The development of novel algorithms and systems to process these data requires the design, generation,…

For any group $G$ with subgroup $H$ and a set of representatives $T$ from the set of cosets $G/H$, we develop a rewriting system from $G$ that bequeaths a product into the set decomposition $T\times H$ of $G$, converting it into a group. In…

We construct a category, $\Omega$, of which the objects are pointed categories and the arrows are pointed correspondences. The notion of a "spec datum" is introduced, as a certain relation between categories, of which one has been given a…

The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices are connected by an edge if and only if the sum of their…

We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…

Despite significant advancements in causal research on graphs and its application to cracking label imbalance, the role of edge features in detecting the causal effects within graphs has been largely overlooked, leaving existing methods…

The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…