Results 31 to 40 of about 12,533 (241)
Galois coverings of one-sided bimodule problems
Applying geometric methods of 2-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite representation type.
Vyacheslav Babych, Nataliya Golovashchuk
doaj +1 more source
Finite temperature at finite places
A bstract This paper studies AdS/CFT in its p -adic version (at the “finite place”) in the setting where the bulk geometry is made up of the Tate curve, a discrete quotient of the Bruhat-Tits tree.
An Huang, Christian Baadsgaard Jepsen
openaire +3 more sources
Control in Romanian and Se constructions
In this paper, we account for different patterns found in complement clauses of se constructions in Romanian and Spanish. In Romanian, a se construction cannot host an infinitival complement, an apparently controlled clause, whereas in Spanish a se ...
Katie VanDyne, Jonathan E. MacDonald
doaj +1 more source
Crowdsourcing and Minority Languages: The Case of Galician Inflected Infinitives1
Results from a crowdsourced audio questionnaire show that inflected infinitives in Galician are acceptable in a broad range of contexts, different from those described for European Portuguese.
Michelle Sheehan +2 more
doaj +1 more source
Tropical Graph Parameters [PDF]
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lovász and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph classes of ...
Nadia Labai, Johann Makowsky
doaj +1 more source
Finite covers with finite kernels
The author considers certain infinite imprimitive automorphism groups, motivated by model-theoretic questions on classes of \(\aleph_0\)-categorical structures. The basic notion is that of a permutation structure, that is a set \(X\) together with a closed subgroup of \(\text{Sym}(X)\) (denoted \(\text{Aut}(X)\)).
openaire +1 more source
Korean honorific agreement as the marginal requirement for syntactic finiteness
This study argues that smaller-than-TP domains can be finite. This position contrasts with the conventional argument that finiteness of a clause is tied to T(ense), but it is in line with alternative proposals.
Stanley Nam
doaj +2 more sources
Participles and Finiteness: The Case of Akhvakh
Akhvakh, a Nakh-Daghestanian language belonging to the Andic (sub-) branch of the Nakh-Daghestanian family, has participial relative clauses headed by verb forms that can also head independent clauses. Akhvakh data contradict the inflectional approach to
Denis Creissels
doaj +1 more source
A new analysis of ‘A-not-A questions’ in Mandarin Chinese
The analysis of the so-called ‘A-not-A’ questions in Mandarin Chinese, where negation occurs between two identical elements at the VP edge, has basically remained the same since C.-T. James Huang (1982). The entire sequence ‘A-not-A’ is presented as the
Waltraud Paul
doaj +1 more source
A note on randomly stopped sums with zero mean increments
In this paper, the asmptotics is considered for the distribution tail of a randomly stopped sum ${S_{\nu }}={X_{1}}+\cdots +{X_{\nu }}$ of independent identically distributed consistently varying random variables with zero mean, where ν is a counting ...
Remigijus Leipus, Jonas Šiaulys
doaj +1 more source

