Results 41 to 50 of about 2,753 (280)
Polyadic Hopf Algebras and Quantum Groups
This article continues the study of concrete algebra-like structures in our polyadic approach, where the arities of all operations are initially taken as arbitrary, but the relations between them, the arity shapes, are to be found from some natural ...
S. Duplij
doaj +1 more source
Answer Counting under Guarded TGDs [PDF]
We study the complexity of answer counting for ontology-mediated queries and for querying under constraints, considering conjunctive queries and unions thereof (UCQs) as the query language and guarded TGDs as the ontology and constraint language ...
Cristina Feier +2 more
doaj +1 more source
The Mask of Odd Points n-Ary Interpolating Subdivision Scheme
We present an explicit formula for the mask of odd points n-ary, for any odd n⩾3, interpolating subdivision schemes. This formula provides the mask of lower and higher arity schemes. The 3-point and 5-point a-ary schemes introduced by Lian, 2008, and (2m+
Ghulam Mustafa +3 more
doaj +1 more source
For many extensions \(L\) of first-order logic considered for finite structures there is a natural notion of arity of a formula (e.g., the maximal arity of a bounded second-order variable in a formula of fixed-point logic). Denote by \(L^k\) the fragment of \(L\) consisting of the sentences of \(L\) of arity \(\leq k\).
openaire +3 more sources
Some simple varieties of trees arising in permutation analysis [PDF]
After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees.
Mathilde Bouvel +2 more
doaj +1 more source
Mean (standard error) response error rates and times (ms) for each arity condition.
Yuji Takeda (178444) +2 more
core +1 more source
The minimal arity of near unanimity polymorphisms [PDF]
Abstract Dmitriy Zhuk has proved that there exist relational structures which admit near unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches the known upper bounds. We present a simplified and explicit construction of such structures and a detailed, self–contained proof.
Barto, Libor, Draganov, Ondřej
openaire +2 more sources
Green’s Relations on Submonoids of Generalized Hypersubstitutions of Type (n)
A generalized hypersubstitution of type τ = (n) is a function which takes the n-ary operation symbol f to the term of the same type σ(f ) which does not necessarily preserve the arity. Let HypG(n) be the set of all these generalized hypersubstitutions of
Kunama Pornpimol, Leeratanavalee Sorasak
doaj +1 more source
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source

