Results 41 to 50 of about 3,954,992 (288)
On inversion sets and the weak order in Coxeter groups [PDF]
, 2016 In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and their position
Hohlweg, Christophe +1 more
core +2 more sources
Permutation graphs and the weak Bruhat order
The Art of Discrete and Applied Mathematics, 2022 Summary: Permutation graphs are graphs associated with permutations where edges represent inversions. We study different classes of permutation graphs and isomorphic permutation graphs. A complete answer of a basic isomorphism question is given for trees.
Brualdi, R.A., Dahl, Geir
openaire +2 more sources
Two weak solutions for some singular fourth order elliptic problems
Electronic Journal of Qualitative Theory of Differential Equations, 2016 In this paper, we establish the existence of at least two distinct weak solutions for some singular elliptic problems involving a $p$-biharmonic operator, subject to Navier boundary conditions in a smooth bounded domain in $\mathbb{R}^N$.
Lin Li
doaj +1 more source
Asymmetric second-order stochastic resonance weak fault feature extraction method
Measurement + Control, 2020 To solve the problem that the weak fault signal is difficult to extract under strong background noise, an asymmetric second-order stochastic resonance method is proposed.
Jiachen Tang, Boqiang Shi
doaj +1 more source
Higher-order Convergence Statistics for Three-dimensional Weak Gravitational Lensing [PDF]
, 2010 Weak gravitational lensing on a cosmological scales can provide strong constraints both on the nature of dark matter and the dark energy equation of state. Most current weak lensing studies are restricted to (two-dimensional) projections, but tomographic
Alan Heavens +81 more
core +1 more source
On chains of matroids in the weak order
European Journal of Combinatorics, 2015 Weak maps in matroids originate an order called weak order. In this paper, we characterize some chains of matroids which cannot be increased with respect to the weak order. We also give conditions for a pair of matroids to have few non-common bases.
Manoel Lemos, Maria Isabelle Silva
openaire +1 more source
Restricted generating trees for weak orderings
Discrete Mathematics & Theoretical Computer Science, 2022 Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated by inserting a new variable into each node at every step.
Daniel Birmajer +3 more
openaire +3 more sources
Weak orders admitting a perpendicular linear order
Discrete Mathematics, 2007 The authors characterize the finite weak orders admitting a perpendicular linear order and give two basic results. First, every linear order having at least four elements has a perpendicular linear order and, second, if \(q(n)\) denotes the number of linear orders perpendicular to the natural order on \([1, \ldots, n]\), then \(\lim_{n \rightarrow ...
Maurice Pouzet, Imed Zaguia
openaire +2 more sources
Second Order Corrections to Weak Lensing by Large-Scale Structure [PDF]
, 2002 We calculate corrections to the power spectrum predictions of weak lensing by large scale structure due to higher order effects in the gravitational potential.
Asantha Cooray +5 more
core +2 more sources
Journal of Algebra, 1993 Let \(D\) be a division ring with center \(F\) and an involution \(*\). In this paper the author studies a special class of Baer-orderings, so called weak \(*\)-orderings, on \(D\). One motivation for this is the fact that \(*\)- fields which are finite dimensional over their centers only admit \(*\)- orderings if they are trivial.
openaire +2 more sources