Results 11 to 20 of about 1,064 (264)
Removahedral Congruences versus Permutree Congruences [PDF]
The Electronic Journal of Combinatorics, 2021 The associahedron is classically constructed as a removahedron, i.e. by deleting inequalities in the facet description of the permutahedron. This removahedral construction extends to all permutreehedra (which interpolate between the permutahedron, the associahedron and the cube).
Albertin, Doriann +2 more
openaire +4 more sources
CONGRUENCE OF ULTRAFILTERS [PDF]
The Journal of Symbolic Logic, 2021 AbstractWe continue the research of the relation $\hspace {1mm}\widetilde {\mid }\hspace {1mm}$ on the set $\beta \mathbb {N}$ of ultrafilters on $\mathbb {N}$ , defined as an extension of the divisibility relation. It is a quasiorder, so we see it as an order on the set of $=_{\sim }$ -equivalence classes, where $\mathcal {F}=_{\sim }\mathcal ...
openaire +3 more sources
PRINCIPAL AND SYNTACTIC CONGRUENCES IN CONGRUENCE-DISTRIBUTIVE AND CONGRUENCE-PERMUTABLE VARIETIES [PDF]
Journal of the Australian Mathematical Society, 2008 AbstractWe give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or, equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very ...
Davey, Brian A. +3 more
openaire +2 more sources
Congruence for Structural Congruences [PDF]
, 2005 Structural congruences have been used to define the semantics and to capture inherent properties of language constructs. They have been used as an addendum to transition system specifications in Plotkin’s style of Structural Operational Semantics (SOS).
Mousavi, M.R., Reniers, M.A.
openaire +2 more sources
Canonical forms for unitary congruence and *congruence [PDF]
Linear and Multilinear Algebra, 2009 We use methods of the general theory of congruence and *congruence for complex matrices--regularization and cosquares-to determine a unitary congruence canonical form (respectively, a unitary *congruence canonical form) for complex matrices A such that \bar{A}A (respectively, A^2) is normal.
Horn, Roger A., Sergeichuk, Vladimir V.
openaire +2 more sources
Soft Computing, 2016 For an algebra [Formula: see text] belonging to a quasivariety [Formula: see text], the quotient [Formula: see text] need not belong to [Formula: see text] for every [Formula: see text]. The natural question arises for which [Formula: see text]. We consider algebras [Formula: see text] of type (2, 0) where a partial order relation is determined by the ...
Ivan Chajda, Helmut Länger
openaire +3 more sources
ON WEIGHTING AND CONGRUENCE [PDF]
Cladistics, 1996 Abstract —A priori differential weighting of molecular characters is a common methodological practice in molecular phylogenetics and evolution. This has been a largely subjective exercise with few criteria for deciding which characters to down‐weight and how much to do so.
Marc W, Allard, James M, Carpenter
openaire +2 more sources
MEASURABLE REALIZATIONS OF ABSTRACT SYSTEMS OF CONGRUENCES
Forum of Mathematics, Sigma, 2020 An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and $n$-divisibility of actions ...
CLINTON T. CONLEY +2 more
doaj +1 more source
Congruences and group congruences on a semigroup [PDF]
Semigroup Forum, 2012 Let \(S\) be a semigroup and \(E\) be the set of idempotents of \(S\). A subsemigroup \(N\) of \(S\) is called normal if it is full (i.e., \(E\subseteq S\)), dense (i.e., \((\forall s\in S)(\exists x,y\in S)(sx,ys\in N)\)), reflexive (i.e., \((\forall a,b\in S)(ab\in N\Rightarrow ba\in N)\)) and closed in \(S\) (i.e., \(N\omega=N\), where \(N\omega=\{s\
openaire +2 more sources
Algebraic Method for Solving System of Linear Congruences
Recoletos Multidisciplinary Research Journal, 2015 The paper aimed to devise an alternative algorithm for solving system of linear congruences. This algorithm is an extension of the algebraic algorithm which is an alternative method for finding solutions in linear congruences.
Polemer M. Cuarto
doaj +1 more source