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 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.     

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 .     

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.     

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 .     

Fractal graphs

The lexicographic sum of graphs is defined as follows. Let be a graph. With each associate a graph . The lexicographic sum of the graphs over is obtained from by substituting each by . Given distinct , we have all the possible edges in the lexicographic sum between and if , and none otherwise. When all the graphs are isomorphic to some graph , the lexicographic sum of the graphs over is called the lexicographic product of by and is denoted by . We say that a graph is fractal if there exists a graph , with at least two vertices, such that . There is a simple way to construct fractal graphs. Let be a graph with at least two vertices. The graph is defined on the set of functions from to as follows. Given distinct is an edge of if is an edge of , where is the smallest integer such that . The graph is fractal because . We prove that a fractal graph is isomorphic to a lexicographic sum over an induced subgraph of , which is itself fractal.     

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 .     

The size-Ramsey number of powers of paths

Given graphs and and a positive integer , say that is -Ramsey for , denoted , if every -coloring of the edges of contains a monochromatic copy of . The size-Ramsey number of a graph is defined to be . Answering a question of Conlon, we prove that, for every fixed , we have , where is the th power of the -vertex path (ie, the graph with vertex set and all edges such that the distance between and in is at most ). Our proof is probabilistic, but can also be made constructive.     

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 .     

Distinct partial sums in cyclic groups: polynomial method and constructive approaches

Let be an abelian group and consider a subset with . Given an ordering of the elements of , define its partial sums by and for . We consider the following conjecture of Alspach: for any cyclic group and any subset with , it is possible to find an ordering of the elements of such that no two of its partial sums and are equal for . We show that Alspach’s Conjecture holds for prime when and when . The former result is by direct construction, the latter is nonconstructive and uses the polynomial method. We also use the polynomial method to show that for prime a sequence of length having distinct partial sums exists in any subset of of size at least in all but at most a bounded number of cases.     

Deza graphs with parameters and

A Deza graph with parameters is a ‐regular graph with vertices, in which any two vertices have or () common neighbours. A Deza graph is strictly Deza if it has diameter , and is not strongly regular. In an earlier paper, the two last authors et al characterised the strictly Deza graphs with and , where is the number of vertices with common neighbours with a given vertex. Here, we start with a characterisation of Deza graphs (not necessarily strictly Deza graphs) with parameters . Then, we deal with the case and , and thus complete the characterisation of Deza graphs with . It follows that all Deza graphs with , and can be made from special strongly regular graphs, and in fact are strictly Deza except for . We present several examples of such strongly regular graphs. A divisible design graph (DDG) is a special Deza graph, and a Deza graph with is a DDG. The present characterisation reveals an error in a paper on DDGs by the second author et al. We discuss the cause and the consequences of this mistake and give the required errata.     

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.     

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.     

Variable Hardy–Lorentz spaces

Let be a measurable function on with . We introduce the variable Hardy–Lorentz space for via the radial grand maximal function. Under the assumption that satisfies the log‐Hölder condition, we establish a version of Fefferman–Stein vector‐valued inequality in variable Lorentz space by interpolation. We also construct atomic decompositions for , and develop a theory of real interpolation and formulate the dual space of the variable Hardy–Lorentz space with and . As a byproduct, we obtain a new John–Nirenberg theorem. Furthermore, we get equivalent characterizations of the variable Hardy–Lorentz space by means of the Lusin area function, the Littlewood–Paley g‐function and the Littlewood–Paley ‐function. Finally, we investigate the boundedness of singular operators on for and .     

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 polynomial approximations to AC

Classical approximation results show that any circuit of size and depth has an ‐error probabilistic polynomial over the reals of degree . We improve this upper bound to , which is much better for small values of . We then use this result to show that ‐wise independence fools circuits of size and depth up to error at most , improving on Tal's strengthening of Braverman's result that ‐wise independence suffices. To our knowledge, this is the first PRG construction for that achieves optimal dependence on the error . We also prove lower bounds on the best polynomial approximations to . We show that any polynomial approximating the function on bits to a small constant error must have degree at least . This result improves exponentially on a result of Meka, Nguyen, and Vu (Theory Comput. 2016).