Results 11 to 20 of about 40,361 (263)
Polyadic Analogs of Direct Product
We propose a generalization of the external direct product concept to polyadic algebraic structures which introduces novel properties in two ways: the arity of the product can differ from that of the constituents, and the elements from different ...
Steven Duplij
doaj +1 more source
The Family of Multiparameter Quaternary Subdivision Schemes
In the field of subdivision, the smoothness increases as the arity of schemes increases. The family of high arity schemes gives high smoothness comparative to low arity schemes.
Ghulam Mustafa +4 more
doaj +1 more source
Practical Variable-Arity Polymorphism [PDF]
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scripting languages such as Scheme and Python. Statically typed languages also accommodate modest forms of variable-arity functions, but even ML and Haskell, languages with ...
T. Stephen Strickland +2 more
openaire +2 more sources
The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs [PDF]
We study the problem of query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases over signatures of arity two. We focus on the class of queries closed under homomorphisms, or, equivalently, the infinite unions of ...
Antoine Amarilli, İsmail İlkan Ceylan
doaj +1 more source
Higher Regularity, Inverse and Polyadic Semigroups
We generalize the regularity concept for semigroups in two ways simultaneously: to higher regularity and to higher arity. We show that the one-relational and multi-relational formulations of higher regularity do not coincide, and each element has several
Steven Duplij
doaj +1 more source
Characteristic Sequence of Strongly Minimal Directed Single Graphs of 1-Arity
In this paper, we will classify the strongly minimal directed single graphs of 1-arity by axiomatizing the theory of characteristic sequence of such a graph. Then we will show this theory is complete by using Łos-Vaught test. Complete theory is important
Abeer M. Albalahi
doaj +1 more source
Universal Horn Sentences and the Joint Embedding Property [PDF]
The finite models of a universal sentence $\Phi$ in a finite relational signature are the age of a structure if and only if $\Phi$ has the joint embedding property. We prove that the computational problem whether a given universal sentence $\Phi$ has the
Manuel Bodirsky +2 more
doaj +1 more source
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width [PDF]
Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of local-consistency methods in ...
Wrona, Micha?
core +3 more sources
Arity-generic datatype-generic programming [PDF]
Some programs are doubly-generic. For example, map is datatype-generic in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in ...
Stephanie Weirich, Chris Casinghino
openaire +2 more sources
Around the root of random multidimensional quadtrees [PDF]
We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source

