Results 91 to 100 of about 9,133,272 (216)
Retskrivningsordbog mellem to stole
Hermes, 2013 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
A theorem on refining division orders by the reverse lexicographic order
Duke Mathematical Journal, 1987 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
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
Quality and Reliability Engineering International, Volume 42, Issue 6, Page 3326-3334, October 2026.ABSTRACT We introduce Circulant Matrix‐Based Box–Behnken Designs (CBBDs), a new class of three‐level, second‐order response surface designs constructed using circulant matrix structures. These designs satisfy an enhanced orthogonal minimally aliased (OMA∗${\rm OMA}^*$) property: they retain the classical OMA property—where main effects are orthogonal ...
Tung‐Dinh Pham, Nam‐Ky Nguyen
wiley +1 more source
Lexicographic Optimization on Polytopes is Linear Programming [PDF]
Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.lexicographic optimization;linear ...
Tijs, S.H.
core
Bounded diameter monochromatic component covers
Mathematika, Volume 72, Issue 4, October 2026.Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
Weighted Average Lexicographic Values for Share Sets and Balanced Cooperative Games [PDF]
Inspired by Kalai-Samet [4] and Tijs [11], weighted average lexicographic values are introduced for share sets and for cores of cooperative games using induction arguments. Continuity properties and monotonicity properties of these weighted lexicographic
Tijs, S.H., Torre, A., Caprari, E.
core
Lexicographic shellability, matroids, and pure order ideals
Advances in Applied Mathematics, 2015 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 +2 more sources
The lexicographic preference for a son: evidence from household data in Vietnam [PDF]
This paper examines son preferences by specifying sex composition by birth order of existing children as key independent variables. The results indicate a lexicographic preference for a son by mothers aged 50 years and older.
Tien Manh Vu
core
Order and quasiperiodicity in episturmian words [PDF]
, 2007 We prove a refinement of a recent characterization of infinite episturmian words via lexicographic orderings (Glen-Justin-Pirillo, 2007). This allows us to easily characterize the strict episturmian words that are "infinite Lyndon words", i.e., those ...
Glen, A.
core
A Transtextual Approach to Lexicographic Functions
Lexikos, 2011 <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