The paper presents three classes of bent functions, including rotation symmetric bent functions and two-rotation symmetric bent functions. The constructions presented in the literature have had restrictions on the integer value of n or have an algebraic degree of no more than four. However, the proposed functions can have any algebraic degree ranging from two to n/2. The paper also includes the bent idempotent functions with the maximum algebraic degree of n/2. This is significant because these classes of functions are cryptographically significant Boolean functions, and having a wider range of algebraic degrees can improve their security. The results of this paper can be useful in designing cryptographic algorithms, particularly in block ciphers and stream ciphers. Overall, the paper introduces new classes of bent functions with improved algebraic degrees that could potentially enhance the security of cryptographic systems.

The paper explores the results of ordered semigroups applied to ordered hypersemigroups. The study found that the ideals of an ordered hypergroupoid are idempotent only if for any two ideals, their intersection is equal to their multiplication. Further, the ideals of an ordered hypersemigroup are idempotent only if it is semisimple. The paper also found that the ideals of an ordered hypersemigroup are weakly prime when they are idempotent and form a chain, and prime only when they form a chain and the hypersemigroup is intra-regular. The research serves as an example of how to extend ordered semigroups to ordered hypersemigroups.

The article discusses the use of non-idempotent intersection types in the λ-calculus and how to analyze it for various parameters. The article covers different topics, including head normalization, weak normalization, weak head normalization, strong normalization, inhabitation, exact bounds, and principal typings. The article notes that the traditional reducibility technique used for idempotent types is not necessary in this framework, and instead, more straightforward combinatorial arguments can be utilized. The use of non-idempotent intersection types proves beneficial for various reasons, such as providing more expressive power to type systems and allowing for the creation of more robust systems. However, the article notes that the use of non-idempotent intersection types can also introduce challenges, such as increased complexity in type inference and the need for careful implementation. Overall, the article provides insights into the use of non-idempotent intersection types in the λ-calculus and highlights its potential benefit and challenges.

Researchers have developed a method to integrate RGB and HHA features in RGB-D semantic segmentation tasks, which can improve segmentation performance. It has been demonstrated that HHA embeddings encode valuable depth features, and using them in addition to RGB images can enhance segmentation results. The team's proposed novel method employed idempotent mappings, as opposed to identity mappings, in ResNet-based two-stream networks. By coupling the previously separated branches, information from both modalities can be mixed, while retaining the good information flow character of ResNet. No network blocks or parameters were added, meaning a small modification was required on basic two-stream networks. The researchers conducted tests on NYUDv2 and SUN-RGBD datasets and achieved state-of-the-art results. Their method has considerable potential for improving the performance of RGB-D semantic segmentation systems.