Analysis of lettuce evapotranspiration across soil water

In this study, we evaluated the lettuce accumulated evapotranspiration (ET) across four levels of irrigation, using a nonlinear mixed‐effects model. The plants were grown in protected environments and monitored over 23 consecutive days. When the moisture of the substrate in the vessels reached 50% of their maximum retention capacity, the water levels were elevated according to four treatments: , , , and . The model appeared to provide a good fit to the data and showed that the estimates of the maximum amount of accumulated ET were similar for the three treatments with soil water deficit and lower for . The results of the study supported the idea that optimization of the ET of lettuce plants could be achieved through irrigation with deficit, also indicating that the economical use of water was the most efficient way to boost agricultural production. Recommendations for resource managers

• The continued growth of the world population will result in a decrease of quality and availability of water and also an increase in demand for food. Therefore, sustainability will depend on high agricultural productivity with rational use of water.
• Considered the most efficient technology for boosting agricultural productivity, irrigation is also the largest water consumer in the world. With any kind of irrigation in the vegetable production area, the water intake for the plants must be treated with great caution.
• Both a lack or excess in water can decrease plant productivity. The amount of water available in the soil should be enough to maximize production. It is shown that high levels of irrigation are not necessary for this.
• It is important to balance the amount of irrigated water for an optimal level, in order that the production has its the production is maximized and valuable water resources are not wasted.

     

Catch‐to‐stock dependence: The case of small pelagic fishery with bounded harvesting effort

Biologic characteristics of schooling fish species explain why the rates of harvesting in pelagic fisheries are not proportional to the existent stock size and may exhibit no variation between the periods of fish abundance and scarcity. Therefore, the stock‐dependent nonlinearities in catchability must be reflected in the design of flexible fishing policies, which target the sustainable exploitation of this important natural resource. In this study, such nonlinearities are expressed through eventual variability of the “catch‐to‐stock” parameter that measures the sensitivity of an additional catch yield to marginal changes in the fish‐stock level. Using the optimal control modeling framework, we establish that each value of the “catch‐to‐stock” parameter generates a unique steady‐state size of the fish stock and the latter engenders an optimal fishing policy that can be sustained as long as the “catch‐to‐stock” parameter remains unchanged. We also prove the continuous dependence of the steady‐state stock and underlying fishing policy upon the mentioned “catch‐to‐stock” parameter and then focus on the analysis of the equilibrium responses to changes in this parameter induced by external perturbations. Recommendations for Resource Managers

• Marginal catches of pelagic fish stocks do not react in a linear way to changes in existing stock level, and the latter is captured in our model by the “catch‐to‐stock” parameter . Each observable value of engenders a unique steady‐state stock size that defines an optimal fishing policy, which can be sustained as long as remains unchanged.
• The ability of fishery managers to detect variations in the levels of hyperstability expressed by the “catch‐to‐stock” parameter may help them to anticipate new equilibrium responses in stock evolution and to make timely adjustments in the fishing policy.
• Plausible estimations of the “catch‐to‐stock” parameter , as well as detection of its possible alterations, can be carried out within the framework of Management Strategy Evaluation (MSE) approach where different data collected inside and outside the fishery are contrasted via the validation of a relatively simple decision‐making model (presented in this paper) coupled with other “operation models” of higher complexity.
• If the “catch‐to‐stock” parameter cannot be reasonably assessed (), the fishery managers may rely upon the lower bound of stationary stock size, which depends on economic and biological factors (such as the present and future economic values of the exploited fish stock, its marginal productivity, and underlying dynamics of biological growth).

     

Dynamics of coral reef models in the presence of parrotfish

The decline of coral reefs characterized by macroalgae increase has been a global threat. We consider a slightly modified version of an ordinary differential equation (ODE) model proposed in Blackwood, Hastings, and Mumby [Theor. Ecol. 5 (2012), pp. 105–114] that explicitly considers the role of parrotfish grazing on coral reef dynamics. We perform complete stability, bifurcation, and persistence analysis for this model. If the fishing effort (f) is in between two critical values and , then the system has a unique interior equilibrium, which is stable if and unstable if . If is less (more) than these critical values, then the system has up to two (zero) interior equilibria. Also, we develop a more realistic delay differential equation (DDE) model to incorporate the time delay and treating it as the bifurcation parameter, and we prove that Hopf bifurcation about the interior equilibria could occur at critical time delays, which illustrate the potential importance of the inherent time delay in a coral reef ecosystem. Recommendations for Resource Managers

• One serious threat to coral reefs is overfishing of grazing species, including high level of algal abundance. Fishing alters the entire dynamics of a reef (Hughes, Baird, & Bellwood, 2003), for which the coral cover was predicted to decline rapidly (Mumby, 2006). One major issue is to reverse and develop appropriate management to increase or maintain coral resilience.
• We have provided a detailed local and global analysis of model (Blackwood, Hastings, & Mumby, 2012) and obtained an ecologically meaningful attracting region, for which there is a chance of stable coexistence of coral–algal–fish state.
• The healthy reefs switch to unhealthy state, and the macroalgae–parrotfish state becomes stable as the fishing effort increases through some critical values. Also, for some critical time delays, a switch between healthy and unhealthy reef states occurs through a Hopf bifurcation, which can only appear in the delay differential equation (DDE) model. Eventually, for large enough time delay, oscillations appear and an unhealthy state occurs.

     

Reductions on equivalence relations generated by universal sets

Let X, Y be Polish spaces, , . We say A is universal for Γ provided that each x‐section of A is in Γ and each element of Γ occurs as an x‐section of A. An equivalence relation generated by a set is denoted by , where . The following results are shown:

• (1) If A is a set universal for all nonempty closed subsets of Y, then is a equivalence relation and .
• (2) If A is a set universal for all countable subsets of Y, then is a equivalence relation, and
  • (i) and ;
  • (ii) if , then ;
  • (iii) if every set is Lebesgue measurable or has the Baire property, then .
  • (iv) for , if every set has the Baire property, and E is any equivalence relation, then .

     

On Turán problems for Cartesian products of graphs

Let be disjoint sets of sizes and . Let be a family of quadruples, having elements from and from , such that any subset with and contains one of the quadruples. We prove that the smallest size of is as . We also solve asymptotically a more general two‐partite Turán problem for quadruples.     

The maximum number of columns in supersaturated designs with

Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle .     

A complete solution to existence of H designs

An H design is a triple , where is a set of points, a partition of into disjoint sets of size , and a set of ‐element transverses of , such that each ‐element transverse of is contained in exactly one of them. In 1990, Mills determined the existence of an H design with . In this paper, an efficient construction shows that an H exists for any integer with . Consequently, the necessary and sufficient conditions for the existence of an H design are , , and , with a definite exception .     

On the relative strengths of fragments of collection

Let be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, Δ₀‐separation and set foundation. This paper studies the relative strength of set theories obtained by adding fragments of the set‐theoretic collection scheme to . We focus on two common parameterisations of the collection: ‐collection, which is the usual collection scheme restricted to ‐formulae, and strong ‐collection, which is equivalent to ‐collection plus ‐separation. The main result of this paper shows that for all ,

1. proves that there exists a transitive model of Zermelo Set Theory plus ‐collection,
2. the theory is ‐conservative over the theory .

It is also shown that (2) holds for when the Axiom of Choice is included in the base theory. The final section indicates how the proofs of (1) and (2) can be modified to obtain analogues of these results for theories obtained by adding fragments of collection to a base theory (Kripke‐Platek Set Theory with Infinity plus ) that does not include the powerset axiom.     

On perfect matchings in matching covered graphs

A graph is matching-covered if every edge of is contained in a perfect matching. A matching-covered graph is strongly coverable if, for any edge of , the subgraph is still matching-covered. An edge subset of a matching-covered graph is feasible if there exist two perfect matchings and such that , and an edge subset with at least two edges is an equivalent set if a perfect matching of contains either all edges in or none of them. A strongly matchable graph does not have an equivalent set, and any two independent edges of form a feasible set. In this paper, we show that for every integer , there exist infinitely many -regular graphs of class 1 with an arbitrarily large equivalent set that is not switching-equivalent to either or , which provides a negative answer to a problem of Lukot’ka and Rollová. For a matching-covered bipartite graph , we show that has an equivalent set if and only if it has a 2-edge-cut that separates into two balanced subgraphs, and is strongly coverable if and only if every edge-cut separating into two balanced subgraphs and satisfies and .     

Filling the complexity gaps for colouring planar and bounded degree graphs

A colouring of a graph is a function such that for every . A -regular list assignment of is a function with domain such that for every , is a subset of of size . A colouring of respects a -regular list assignment of if for every . A graph is -choosable if for every -regular list assignment of , there exists a colouring of that respects . We may also ask if for a given -regular list assignment of a given graph , there exists a colouring of that respects . This yields the -Regular List Colouring problem. For , we determine a family of classes of planar graphs, such that either -Regular List Colouring is -complete for instances with , or every is -choosable. By using known examples of non--choosable and non--choosable graphs, this enables us to classify the complexity of -Regular List Colouring restricted to planar graphs, planar bipartite graphs, planar triangle-free graphs, and planar graphs with no -cycles and no -cycles. We also classify the complexity of -Regular List Colouring and a number of related colouring problems for graphs with bounded maximum degree.     

High nonassociativity in order 8 and an associative index estimate

Let be a quasigroup. Put and assume that . Let and be the number of left and right translations of that are fixed point free. Put . Denote by the number of idempotents of . It is shown that . Call extremely nonassociative if . The paper reports what seems to be the first known example of such a quasigroup, with , , and . It also provides supporting theory for a search that verified for all quasigroups of order .     

On the honeymoon Oberwolfach problem

The honeymoon Oberwolfach problem HOP asks the following question. Given newlywed couples at a conference and round tables of sizes , is it possible to arrange the participants at these tables for meals so that each participant sits next to their spouse at every meal and sits next to every other participant exactly once? A solution to HOP is a decomposition of , the complete graph with additional copies of a fixed 1‐factor , into 2‐factors, each consisting of disjoint ‐alternating cycles of lengths . It is also equivalent to a semi‐uniform 1‐factorization of of type ; that is, a 1‐factorization such that for all , the 2‐factor consists of disjoint cycles of lengths . In this paper, we first introduce the honeymoon Oberwolfach problem and then present several results. Most notably, we completely solve the case with uniform cycle lengths, that is, HOP. In addition, we show that HOP has a solution in each of the following cases: ; is odd and ; as well as for all . We also show that HOP has a solution whenever is odd and the Oberwolfach problem with tables of sizes has a solution.     

A dichotomy for the kernel by H-walks problem in digraphs

Let be a digraph which may contain loops, and let be a loopless digraph with a coloring of its arcs . An -walk of is a walk of such that is an arc of , for every . For , we say that reaches by -walks if there exists an -walk from to in . A subset is a kernel by -walks of if every vertex in reaches by -walks some vertex in , and no vertex in can reach another vertex in by -walks. A panchromatic pattern is a digraph such that every -arc-colored digraph has a kernel by -walks. In this study, we prove that every digraph is either a panchromatic pattern, or the problem of determining whether an arc-colored digraph has a kernel by -walks is -complete.     

On the limit Sobolev regularity for Dirichlet and Neumann problems on Lipschitz domains

We construct a bounded C¹ domain Ω in for which the regularity for the Dirichlet and Neumann problems for the Laplacian cannot be improved, that is, there exists f in such that the solution of in Ω and either on or on is contained in but not in for any . An analogous result holds for Sobolev spaces with .     

Phase transitions in graphs on orientable surfaces

Let be the orientable surface of genus and denote by the class of all graphs on vertex set with edges embeddable on . We prove that the component structure of a graph chosen uniformly at random from features two phase transitions. The first phase transition mirrors the classical phase transition in the Erd?s‐Rényi random graph chosen uniformly at random from all graphs with vertex set and edges. It takes place at , when the giant component emerges. The second phase transition occurs at , when the giant component covers almost all vertices of the graph. This kind of phenomenon is strikingly different from and has only been observed for graphs on surfaces.     

Factorials and the finite sequences of sets

We write for the cardinality of the set of finite sequences of a set which is of cardinality . With the Axiom of Choice (), for every infinite cardinal where is the cardinality of the permutations on a set which is of cardinality . In this paper, we show that “ for every cardinal ”  is provable in and this is the best possible result in the absence of . Similar results are also obtained for : the cardinality of the set of finite sequences without repetition of a set which is of cardinality .     

On the cycle space of a random graph

Write for the cycle space of a graph G, for the subspace of spanned by the copies of the κ‐cycle in G, for the class of graphs satisfying , and for the class of graphs each of whose edges lies in a . We prove that for every odd and , so the 's of a random graph span its cycle space as soon as they cover its edges. For κ = 3 this was shown in [6].     

Dimension of the space generated by Steiner systems

To every Steiner system with parameters on and blocks , we can assign its characteristic vector , which is a ‐vector whose entries are indexed by the ‐subsets of such that for each ‐subset of if and only if . In this paper, we show that the dimension of the vector space generated by all of the characteristic vectors of Steiner systems with parameters is , provided that and there is at least one such system.     

A method to construct 1‐rotational factorizations of complete graphs and solutions to the oberwolfach problem

The concept of a 1‐rotational factorization of a complete graph under a finite group was studied in detail by Buratti and Rinaldi. They found that if admits a 1‐rotational 2‐factorization, then the involutions of are pairwise conjugate. We extend their result by showing that if a finite group admits a 1‐rotational ‐factorization with even and odd, then has at most conjugacy classes containing involutions. Also, we show that if has exactly conjugacy classes containing involutions, then the product of a central involution with an involution in one conjugacy class yields an involution in a different conjugacy class. We then demonstrate a method of constructing a 1‐rotational ‐factorization under given a 1‐rotational 2‐factorization under a finite group . This construction, given a 1‐rotational solution to the Oberwolfach problem , allows us to find a solution to when the ’s are even (), and when is an odd prime, with no restrictions on the ’s.