Abstract. Let δ(P) be the δ-vector of a reflexive polytope P ⊂ R of dimension d and δ(P) the δ-vector of the dual polytope P ⊂ R. In general, δ(P) = δ(P) does not hold. In this paper, we give a higher-dimensional construction of a reflexive polytope whose δ-vector equals the δ-vector of the dual polytope. In particular, we consider the case that the reflexive polytope and the dual polytope are ...

Let K be a field and X an m×n matrix of indeterminates over K. Let K[X] denote the polynomial ring generated by all the indeterminates Xij . For a given positive integer r ≤ min{m, n}, we consider the determinantal ideal Ir+1 = Ir+1(X) generated by all r + 1 minors of X if r < min{m, n} and Ir+1 = (0) otherwise. Let Rr+1 = Rr+1(X) be the determinantal ring K[X]/Ir+1. Determinantal ideals and ri...

The purpose of the present work is to establish a one-to-one correspondence between the family of interval type-2 fuzzy reflexive/tolerance approximation spaces and the family of interval type-2 fuzzy closure spaces.

‎in this article we discuss examples of fractal $omega$-operads‎. ‎thus we show that there is an $omega$-operadic approach to explain existence of‎ ‎the globular set of globular setsfootnote{globular sets are also called $omega$-graphs by the french school.}‎, ‎the reflexive globular set of reflexive globular sets‎, ‎the $omega$-magma of $omega$-magmas‎, ‎and also the reflexive $omega$-magma of...

it is well known fact that binary relations are generalized mathematical functions. contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. some basic operations on functions such as the inverse and composition are applicable to binary relations as well. depending on the domain or range or both are fuzzy value fuzzy set, i...

We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive forests. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating condition is related firstly to connectivity, and thereafter to accessibility from all vertices of H to connected reflexive subgraphs. In the case of partially reflexive paths...

The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...