Results 1 to 10 of about 3,681 (231)
The first-order theory of lexicographic path orderings is undecidable [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Comon, Hubert, Treinen, Ralf
core +4 more sources
Lexicographic shellability, matroids, and pure order ideals
In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This suggests that a pure $O$-sequence can be constructed from combinatorial data arising from the shelling.
Steven Klee, José Alejandro Samper
openaire +3 more sources
Towards Linking User Interface Translation Needs to Lexicographic Theory
In a time of proliferating electronic devices such as smartphones, translators of user interfaces are faced with new challenges, such as the use of existing words in new contexts or in their obtaining new meanings.
André Du Plessis, Marius Swart
doaj +1 more source
Retskrivningsordbog mellem to stole
In November 2012, the fourth edition of the official Danish orthographic dictionary, Retskrivningsordbogen, was published by the Danish Language Board which, according to national law, is authorised to establish the official Danish orthography and ...
Sven Tarp
doaj +1 more source
Continuous Multi-Utility Representations of Preorders and the Chipman Approach
Chipman contended, in stark contrast to the conventional view, that, utility is not a real number but a vector, and that it is inherently lexicographic in nature.
Gianni Bosi +2 more
doaj +1 more source
On Some Problems of the Ideographic Description of Place Names [PDF]
The article deals with some problems of lexicographic treatment of place names. As a model of lexicographic description, the author chooses the ideographic principle which has been extensively used in appellative dictionaries but remains mostly unknown ...
Konstantin A. Gein
doaj
On the lexicographic ordered spaces
Abstract In this paper, we discuss the lexicographic ordered topologies on some products. We mainly prove: (1) The lexicographic ordered space λ γ is base-normal for any ordinals λ and γ. (2) The lexicographic ordered space [ 0 , 1 ) γ is Lindelof for each ordinal γ ≤ ω 1 .
openaire +1 more source
A theorem on refining division orders by the reverse lexicographic order
If \(S_ d\) is the K-vector space of homogeneous polynomials of degree d in \(S=k[x_ 1,...,x_ n]\), where K is an infinite field, then a (partial) order \(>\) on the monomials of \(S_ d\) for each d is compatible with the monoid structure of the monomials of S if \(x^ A>x^ B\) implies \(x^ Cx^ A>x^ Cx^ B\) for all monomials \(x^ C\). If the order \(>\)
Bayer, David, Stillman, Michael
openaire +2 more sources
Conditional lexicographic orders in constraint satisfaction problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard J. Wallace, Nic Wilson
openaire +2 more sources
A Transtextual Approach to Lexicographic Functions
<p>Abstract: The development of theoretical lexicography clearly indicates a movement towards a more general recognition of the role of lexicographic functions.
Rufus H. Gouws
doaj +1 more source

