Results 51 to 60 of about 144,275 (215)
Combinatorics of Toric Arrangements
, 2018 In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement.
Pagaria, Roberto
core +1 more source
The power of many: when genetics met yeasts and high‐throughput
Biological Reviews, EarlyView.ABSTRACT In recent years, complex technological capabilities have evolved, driven by the need to solve complex and integrative biological questions through global analyses. New equipment allows the scaling up and automation of processes which previously were carried out on a very limited scale.
Víctor A. Tallada, Víctor Carranco
wiley +1 more source
Compatible cycles and CHY integrals
Journal of High Energy Physics, 2019 The CHY construction naturally associates a vector in ℝ(n−3)! to every 2- regular graph with n vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of cycles.
Freddy Cachazo +2 more
doaj +1 more source
Stable Lengths on the pants graph are rational [PDF]
, 2014 For the pants graph, there is little known about the behaviour of geodesics, as opposed to quasigeodesics. Brock-Masur-Minsky showed that geodesics or geodesic segments connecting endpoints satisfying a bounded combinatorics condition, such as the stable/
Irmer, Ingrid
core
Business Strategy and the Environment, EarlyView.ABSTRACT Little is known about consumer preferences for combinations of circular business model patterns, despite their potential to benefit the design of product services. This study examines consumer preferences for product‐as‐a‐service offers, combined with circular product attributes, across Sweden and the Netherlands.
Steven Sarasini +5 more
wiley +1 more source
Combinatorics of embeddings [PDF]
, 2011 We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion.
Melikhov, Sergey A.
core
Combinatorics of Explicit Substitutions [PDF]
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018 $λ\upsilon$ is an extension of the $λ$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $λ\upsilon$ focusing on the quantitative aspects of substitution resolution. We exhibit an unexpected correspondence between the counting sequence for $λ\upsilon$-terms and famous Catalan
Bendkowski, Maciej, Lescanne, Pierre
openaire +3 more sources
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source
A note on global existence for boundary value problems
International Journal of Mathematics and Mathematical Sciences, 1989 Upper and lower solutions are used in establlsning global existence results for certain two–point boundary value problems for y‴=f(x,y,y′,y″) and y(n)=f(x,y,y′,...,y(n−1)).
Chuan J. Chyan, Johnny Henderson
doaj +1 more source