Arc-Transitive Graphs of Square-free Order with Valency 11

In this paper, we present a complete list of connected arc-transitive graphs of square-free order with valency 11. The list includes the complete bipartite graph [Formula: see text], the normal Cayley graphs of dihedral groups and the graphs associated with the simple group [Formula: see text] and [Formula: see text], where [Formula: see text] is a prime.

On the Difficulty of Translating Free-Order Case-Marking Languages

Identifying factors that make certain languages harder to model than others is essential to reach language equality in future Natural Language Processing technologies. Free-order case-marking languages, such as Russian, Latin, or Tamil, have proved more challenging than fixed-order languages for the tasks of syntactic parsing and subject-verb agreement prediction. In this work, we investigate whether this class of languages is also more difficult to translate by state-of-the-art Neural Machine Translation (NMT) models. Using a variety of synthetic languages and a newly introduced translation challenge set, we find that word order flexibility in the source language only leads to a very small loss of NMT quality, even though the core verb arguments become impossible to disambiguate in sentences without semantic cues. The latter issue is indeed solved by the addition of case marking. However, in medium- and low-resource settings, the overall NMT quality of fixed-order languages remains unmatched.

Generation of finite groups with cyclic Sylow subgroups

M. C. Slattery [Generation of groups of square-free order, J. Symbolic Comput.42 (2007), 6, 668–677] described computational methods to enumerate, construct and identify finite groups of squarefree order. We generalise Slattery’s result to the class of finite groups that have cyclic Sylow subgroups and provide an implementation for the computer algebra system GAP.

On zero-divisor graphs of commutative rings without identity

Let [Formula: see text] be a finite commutative ring without identity. In this paper, we characterize all finite commutative rings without identity, whose zero-divisor graphs are unicyclic, claw-free and tree. Also, we obtain all finite commutative rings without identity and of cube-free order for which the corresponding zero-divisor graph is toroidal.

LAYANAN APLIKASI GO-JEK: VALIDASI SKALA PENGUKURAN IRSQ PERSEPSI KONSUMEN PADA PENGGUNAAN PLATFORM GO-FOOD

This study aims to analyze the factors forming consumers' perceptions in using the Go-food platform at Go-jek application by adopting an IRSQ measurement scale. This study examined 20 attributes of IRSQ that were analyzed using EFA. The population of this study was the citizens of Jember who have used the Go-food platform at Go-jek application. The sample consisted of 140 respondents collected by employing a purposive sampling technique. The results showed that there were 5 factors forming consumers' perceptions of using the Go-Food platform. The most dominant factor was services performance consisting of the attributes of easy-to-understand online order, fast order confirmation messages, fast loading time, error-free order processing, fast order delivery, and order return policies. The second factor was ease of access consisting of the attributes of various products offering by Go-jek’s partners, promotional products offer, recommendations for the unique products, and various payment methods. The third factor was interaction consisting of the attributes of online chatrooms, product images, and communication interactions. The fourth factor was information that consists of the attributes of product availability information and accuracy of the information, while the fifth factor was security that consists of the attributes of personal information and secure account information.

s-Arc-regular prime-valent Cayley graphs of square-free order

A high cited paper [Feng and Li, One-regular graphs of square-free order of prime valency, Europ. J. Combin. 32 (2011) 261–275] classified 1-arc-regular prime-valent graphs (necessarily Cayley graphs) of square-free order. It is thus interesting to ask what are the [Formula: see text]-arc-regular prime-valent Cayley graphs of square-free order for each [Formula: see text]. In this paper, a complete list of all such graphs is given. The proving process also involves a complete list of the vertex stabilizers of [Formula: see text]-arc-regular prime-valent graphs of any order.

Effective Approach for an Order-of-Magnitude-Accurate Evaluation of the Electron Mobility in Colloidal Quantum Dot Films

Being able to estimate the electron mobility of colloidal quantum dot films is of great importance for determining their suitability to specific applications and would lead to huge savings in terms of time and resources that may otherwise be wasted trying to build and optimize a device whose transport characteristics can be predicted to be poor from the outset. This task is however complicated by the complexity of the system and the large number of parameters that can potentially affect the final result. Here, we derive a simple, fitting-parameter-free, order-of-magnitude-accurate expression to estimate the dark mobility of such 2D structures and validate it by applying it to real systems and comparing its predictions with those of other recently proposed approaches and with available experimental data. The results quantify the superiority of our expression to estimate mobilities in colloidal quantum dot films.