Results 41 to 50 of about 3,681 (231)
A Critical Evaluation of Three Sesotho Dictionaries
Lexikos, 2020 This article gives a perspective on Sesotho lexicography and a critical analysis of the macrostructures and microstructures of three selected Sesotho dictionaries.
Mmasibidi Setaka, D.J. Prinsloo
doaj +1 more source
Lexicographical order, lexicographical index, and linear operators
Linear Algebra and its Applications, 1990 Let \(E=\{e_ 1,...,e_ n\}\) be a basis of an n-dimensional real linear space. The authors define the lexicographical index of \(y=\eta_ 1e_ 1+...+\eta_ 1e_ n\neq 0\) with respect to E as the minimum \(j\in \{1,..,n\}\) such that \(\eta_ j\neq 0\). The lexicographical index of 0 is defined as \(\infty\).
Martínez-Legaz, Juan-Enrique +1 more
openaire +2 more sources
MathematicsIn this paper, we investigate the lexicographic and colexicographic orderings of m-ary vectors of length n, as well as the mirror (left-recursive) reflected Gray code, complementing the classical m-ary reflected Gray code. We present efficient algorithms
Valentin Bakoev
doaj +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, EarlyView.ABSTRACT Chvátal showed that for any tree T $T$ with k $k$ edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1 $R(T,n)=k(n-1)+1$. For r = 3 $r=3$ or 4, we show that, if T $T$ is an r $r$‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ) $R(T,n)={\rm{\Theta }}({n}^{r-1})$.
Jiaxi Nie
wiley +1 more source
Lexicographic semigroupoids. [PDF]
, 1996 The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper-triangular ...
Power, Stephen C.
core
Total time minimizing transportation problem [PDF]
Yugoslav Journal of Operations Research, 2007 This paper shows the total transportation time problem regarding the time of the active transportation routes. If the multiple optimal solutions exist, it is possible to include other criteria as second level of criteria and find the corresponding ...
Nikolić Ilija
doaj +1 more source
Avoiding the Worst Decisions: A Simulation and Experiment
Mathematics, 2023 Many practical decisions are more realistic concerning preventing bad decisions than seeking better ones. However, there has been no behavioral decision theory research on avoiding the worst decisions. This study is the first behavioral decision research
Kazuhisa Takemura +2 more
doaj +1 more source
On lexicographical ordering in multivariate mathematical morphology
Pattern Recognition Letters, 2008 Since mathematical morphology is based on complete lattice theory, a vector ordering method becomes indispensable for its extension to multivariate images. Among the several approaches developed with this purpose, lexicographical orderings are by far the most frequent, as they possess certain desirable theoretical properties.
Erchan Aptoula, Sébastien Lefèvre
openaire +3 more sources
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source
Convex hull characterizations of lexicographic orderings [PDF]
Journal of Global Optimization, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adams, Warren +2 more
openaire +3 more sources