Results 181 to 190 of about 165,979,158 (232)
Motive and Opportunity: Order Choice in a Limit Order Book With Dispersed Information
ABSTRACT We test predictions of market microstructure theory relating to the determinants of order choice in a limit order book where information is dispersed among traders. Using an experimental limit order book, with a large state space, we find that informed traders exhibit patience, compatible with the ‘waiting game’ behaviour described in Foster ...
James Steeley +2 more
wiley +1 more source
ABSTRACT The agronomic benefits of oxygen‐enriched irrigation, such as improved root development, enhanced nutrient uptake, and reduced fertiliser and pesticide requirements, are well documented. However, incorporating oxygenation devices into fertigation systems increases energy demand and material use, thereby incurring additional environmental ...
Alberto Imbernón‐Mulero +4 more
wiley +1 more source
Exact Values and Bounds on Covering Schemes of Strength Two
ABSTRACT In this work, we investigate covering schemes of strength 2 over finite abelian groups, establishing new lower and upper bounds and evaluating new exact values. A main result is a new general lower bound that improves the trivial one and achieves optimality for the binary case. We also develop a recursive relation based on subsets of the group
André G. Castoldi +4 more
wiley +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley +1 more source
ABSTRACT Background Respiratory‐triggered T2‐weighted imaging (T2WI) may use rectilinear sampling (respiratory‐triggered fast recovery fast spin echo [RT‐FRFSE]) or radial sampling (periodically rotated overlapping parallel lines with enhanced reconstruction [PROPELLER]). Their relative performance across breathing patterns is unclear.
Ho Sung Park +6 more
wiley +1 more source
On cohomology rings of a cyclic group and a ring of integers
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On cohomology rings of a cyclic group and a ring of integers
SUT Journal of Mathematics, 2002Let \(p\) be a prime number, \(G\) be the cyclic group of order \(p^\nu\), \(\nu\) a positive integer \(\geq 1\), and \(\Gamma\) be the ring of integers of the cyclotomic field \(\mathbb{Q}(\zeta)\) for a primitive \(p^\nu\)-th root of unity \(\zeta\).
Hayami, Takao, Sanada, Katsunori
openaire +2 more sources

