The Fusion as a Novel Binary Operation on Medial Axes

2010 ◽  
Author(s):  
Ivan Mekhedov ◽  
Leonid Mestetskiy
Keyword(s):  
Binary Operation

Using binary operations to construct a transitive set of block transformations

2020 ◽  
Vol 30 (6) ◽  
pp. 375-389
Author(s):  
Igor V. Cherednik
Keyword(s):  
Binary Operation ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Binary Operations ◽  
The Family ◽  
Transitive Set ◽  
Necessary And Sufficient

AbstractWe study the set of transformations {ΣF : F∈ 𝓑∗(Ω)} implemented by a network Σ with a single binary operation F, where 𝓑∗(Ω) is the set of all binary operations on Ω that are invertible as function of the second variable. We state a criterion of bijectivity of all transformations from the family {ΣF : F∈ 𝓑∗(Ω)} in terms of the structure of the network Σ, identify necessary and sufficient conditions of transitivity of the set of transformations {ΣF : F∈ 𝓑∗(Ω)}, and propose an efficient way of verifying these conditions. We also describe an algorithm for construction of networks Σ with transitive sets of transformations {ΣF : F∈ 𝓑∗(Ω)}.

scholarly journals M-Hazy Vector Spaces over M-Hazy Field

Mathematics ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1118
Author(s):  
Faisal Mehmood ◽  
Fu-Gui Shi
Keyword(s):  
Vector Space ◽  
Linear Transformation ◽  
Binary Operation ◽  
Vector Spaces ◽  
Fundamental Properties ◽  
Classical Algebra ◽  
Important Development ◽  
Fuzzy Algebra ◽  
Convex Spaces

The generalization of binary operation in the classical algebra to fuzzy binary operation is an important development in the field of fuzzy algebra. The paper proposes a new generalization of vector spaces over field, which is called M-hazy vector spaces over M-hazy field. Some fundamental properties of M-hazy field, M-hazy vector spaces, and M-hazy subspaces are studied, and some important results are also proved. Furthermore, the linear transformation of M-hazy vector spaces is studied and their important results are also proved. Finally, it is shown that M-fuzzifying convex spaces are induced by an M-hazy subspace of M-hazy vector space.

scholarly journals Weak integer additive set-labeled graphs: A creative review

2015 ◽  
Vol 08 (03) ◽  
pp. 1550052 ◽  
Author(s):  
N. K. Sudev ◽  
K. A. Germina ◽  
K. P. Chithra
Keyword(s):  
Binary Operation ◽  
Labeled Graphs ◽  
Injective Function ◽  
Power Set

For a non-empty ground set [Formula: see text], finite or infinite, the set-valuation or set-labeling of a given graph [Formula: see text] is an injective function [Formula: see text], where [Formula: see text] is the power set of the set [Formula: see text]. A set-valuation or a set-labeling of a graph [Formula: see text] is an injective set-valued function [Formula: see text] such that the induced function [Formula: see text] is defined by [Formula: see text] for every [Formula: see text], where [Formula: see text] is a binary operation on sets. Let [Formula: see text] be the set of all non-negative integers and [Formula: see text] be its power set. An integer additive set-labeling (IASL) is defined as an injective function [Formula: see text] such that the induced function [Formula: see text] is defined by [Formula: see text]. An IASL [Formula: see text] is said to be an integer additive set-indexer if [Formula: see text] is also injective. A weak IASL is an IASL [Formula: see text] such that [Formula: see text]. In this paper, critical and creative review of certain studies made on the concepts and properties of weak integer additive set-valued graphs is intended.

On Refined Semilattices of Semigroups

2008 ◽  
Vol 15 (02) ◽  
pp. 331-336 ◽  
Author(s):  
Zhengpan Wang ◽  
Yuqi Guo ◽  
K. P. Shum
Keyword(s):  
Binary Operation ◽  
Short Proof ◽  
Semilattice Of Semigroups

We give a short proof for the associativity of the binary operation defined on a refined system of semigroups indexed by a semilattice. The main result given by Zhang, Shum and Zhang in 2001 on the refined semilattice of semigroups is substantially strengthened.

scholarly journals Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates

2018 ◽  
Vol 18 (3-4) ◽  
pp. 390-405 ◽  
Author(s):  
PEDRO CABALAR ◽  
JORGE FANDINNO ◽  
LUIS FARIÑAS DEL CERRO ◽  
DAVID PEARCE
Keyword(s):  
Binary Operation ◽  
Compositional Semantics ◽  
First Order ◽  
Simple Addition ◽  
Logical Language ◽  
Extended Approach ◽  
Logical Term ◽  
New Type ◽  
The One ◽  
Logical Treatment

AbstractIn this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (${\rm QEL}^=_{\cal F}$). Then, we proceed to incorporate a new kind of logical term,intensional set(a construct commonly used to denote the set of objects characterised by a given formula), and to extend${\rm QEL}^=_{\cal F}$semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count,sum,maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the${\rm QEL}^=_{\cal F}$interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to definesumin terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the${\cal A}\mathit{log}$language, when we restrict to that syntactic fragment.

scholarly journals Enumerating Finite Racks, Quandles and Kei

10.37236/3262 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Simon R. Blackburn
Keyword(s):  
Permutation Group ◽  
Lower Bounds ◽  
Binary Operation ◽  
Independent Interest ◽  
Upper And Lower Bounds ◽  
Permutation Groups ◽  
Isomorphism Classes ◽  
Operator Group ◽  
The Relationship

A rack of order $n$ is a binary operation $\vartriangleright$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\vartriangleright)$ is a rack provided that the map $x\mapsto x\vartriangleright y$ is a bijection for all $y\in X$, and $(x\vartriangleright y)\vartriangleright z=(x\vartriangleright z)\vartriangleright (y\vartriangleright z)$ for all $x,y,z\in X$.The paper provides upper and lower bounds of the form $2^{cn^2}$ on the number of isomorphism classes of racks of order $n$. Similar results on the number of isomorphism classes of quandles and kei are obtained. The results of the paper are established by first showing how an arbitrary rack is related to its operator group (the permutation group on $X$ generated by the maps $x\mapsto x\vartriangleright y$ for $y\in Y$), and then applying some of the theory of permutation groups. The relationship between a rack and its operator group extends results of Joyce and of Ryder; this relationship might be of independent interest.

scholarly journals Clifford semigroups and monotonicity

1985 ◽  
Vol 32 (1) ◽  
pp. 83-92
Author(s):  
T.E. Hays
Keyword(s):  
Algebraic Structure ◽  
Binary Operation ◽  
Monotone Function ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Clifford Semigroups ◽  
Necessary And Sufficient

A semigroup S is said to be monotone if its binary operation is a monotone function from S × S into S. This paper utilizes some of the known algebraic structure of Clifford semigroups, semigroups which are unions of groups, to study topological Clifford semigroups which are monotone. It is shown that such semigroups are preserved under products, homomorphisms, and, under certain conditions, closures. Necessary and sufficient conditions for monotonicity of groups, paragroups, bands, compact orthodox Clifford semigroups, and compact bands of groups are developed.

Effect-like algebras induced by means of basic algebras

2010 ◽  
Vol 60 (1) ◽  
Author(s):  
Ivan Chajda
Keyword(s):  
Distributive Lattice ◽  
Effect Algebra ◽  
Binary Operation ◽  
Basic Algebra ◽  
Natural Question ◽  
Lattice Effect Algebra ◽  
Mv Algebra ◽  
Lattice Effect ◽  
Mv Algebras

AbstractHaving an MV-algebra, we can restrict its binary operation addition only to the pairs of orthogonal elements. The resulting structure is known as an effect algebra, precisely distributive lattice effect algebra. Basic algebras were introduced as a generalization of MV-algebras. Hence, there is a natural question what an effect-like algebra can be reached by the above mentioned construction if an MV-algebra is replaced by a basic algebra. This is answered in the paper and properties of these effect-like algebras are studied.

Summary of Elements of Algebraic Theory

1995 ◽  
Author(s):  
F. Iachello ◽  
R. D. Levine
Keyword(s):  
Lie Algebra ◽  
Lie Algebras ◽  
Algebraic Structure ◽  
Binary Operation ◽  
Algebraic Theory ◽  
Quantum Mechanical ◽  
Ordinary Quantum

Algebraic theory makes use of an algebraic structure. The structure appropriate to ordinary quantum mechanical problems is that of a Lie algebra. We begin this chapter with a brief review of the essential concepts of Lie algebras. The binary operation (“multiplication”) in the Lie algebra is that of taking the commutator. As usual, we denote the commutator by square brackets, [A, B] = AB - BA. A set of operators {X} is a Lie algebra when it is closed under commutation.

Sign in / Sign up

Export Citation Format

Share Document