Search

Kovaleva and Spieksma (SIAM J Discrete Math 20(3):48–768, 2006) considered the problem of stabbing a given set of horizontal line segments with the smallest number of horizontal and vertical lines. The standard LP relaxation for this problem is easily shown to have an integrality gap of at most 2 by treating the horizontal and vertical lines separately. However, Kovaleva and Spieksma observed that threshold rounding can be used to obtain an integrality gap of e / (e - 1) ≈ 1.58 which is also shown to be tight. This is one of the rare known examples where the obvious upper bound of 2 on the integrality gap of the standard LP relaxation can be improved. Our goal in this paper is to extend their proof to two other problems where the goal is to stab a set R of objects with horizontal and vertical lines: in the first problem R is a set of horizontal and vertical line segments, and in the second problem R is a set of unit sized squares. The proof of Kovaleva and Spieksma essentially shows the existence of an appropriate threshold which yields the improved approximation factor. We begin by showing that a random threshold picked from an appropriate distribution works. This reduces the problem to finding an appropriate distribution for a desired approximation ratio. In the first problem, we show that the required distribution can be found by solving a linear program. In the second problem, while it seems harder to find the optimal distribution, we show that using the uniform distribution an improved approximation factor can still be obtained by solving a number of linear programs. [ABSTRACT FROM AUTHOR]

In this paper, we investigate representations of links that are either centrally symmetric in R3 or antipodally symmetric in S3. By using the notions of antipodally self-dual and antipodally symmetric maps, introduced and studied by the authors in [L. Montejano, J. L. Ramírez Alfonsín, and I. Rasskin, SIAM J. Discrete Math., 36 (2022), pp. 1551-1566], we are able to present sufficient combinatorial conditions for a link L to admit such representations. The latter naturally provide sufficient conditions for L to be amphichiral. We also introduce another (closely related) method yielding again sufficient conditions for L to be amphichiral. We finally prove that a link L, associated to a map G, is amphichiral if the self-dual pairing of G is not one of 6 specific cases among the classification of the 24 self-dual pairing Cor(G)⊳Aut(G). [ABSTRACT FROM AUTHOR]

In this paper, we adopt the augmented Lagrangian method (ALM) to solve convex quadratic second-order cone programming problems (SOCPs). Fruitful results on the efficiency of the ALM have been established in the literature. Recently, it has been shown in [Cui, Sun, and Toh, Math. Program., 178 (2019), pp. 381-415] that if the quadratic growth condition holds at an optimal solution for the dual problem, then the KKT residual converges to zero R-superlinearly when the ALM is applied to the primal problem. Moreover, Cui, Ding, and Zhao [SIAM J. 0ptim., 27 (2017), pp. 2332-2355] provided sufficient conditions for the quadratic growth condition to hold under the metric subregularity and bounded linear regularity conditions for solving composite matrix optimization problems involving spectral functions. Here, we adopt these recent ideas to analyze the convergence properties of the ALM when applied to SOCPs. To the best of our knowledge, no similar work has been done for SOCPs so far. In our paper, we first provide sufficient conditions to ensure the quadratic growth condition for SOCPs. With these elegant theoretical guarantees, we then design an SOCP solver and apply it to solve various classes of SOCPs, such as minimal enclosing ball problems, classical trust-region subproblems, square-root Lasso problems, and DIMACS Challenge problems. Numerical results show that the proposed ALM based solver is efficient and robust compared to the existing highly developed solvers, such as Mosek and SDPT3. [ABSTRACT FROM AUTHOR]

Let G be a simple graph with no isolated edges. The neighbor-distinguishing edge coloring of G is a proper edge coloring of G such that any pair of adjacent vertices have different sets consisting of colors assigned on their incident edges. The neighbor-distinguishing index of G , denoted by χ a ′ (G) , is the minimum number of colors in such an edge coloring of G . In this paper, we show that if G is a connected planar graph with maximum degree Δ ≥ 14 , then Δ ≤ χ a ′ (G) ≤ Δ + 1 , and χ a ′ (G) = Δ + 1 if and only if G contains a pair of adjacent vertices of maximum degree. This improves a result in [W. Wang, D. Huang, A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree, SIAM J. Discrete Math. 29(2015), 2412–2431], which says that every connected planar graph G with Δ ≥ 16 has Δ ≤ χ a ′ (G) ≤ Δ + 1 , and χ a ′ (G) = Δ + 1 if and only if G contains a pair of adjacent vertices of maximum degree. [ABSTRACT FROM AUTHOR]

This paper provides a probabilistic proof of the comparison result for viscosity solutions of path-dependent semilinear PDEs. We consider the notion of viscosity solutions introduced in [I. Ekren, et al., Ann. Probab., 42 (2014), pp. 204-236], which considers as test functions all those smooth processes which are tangent in mean. When restricted to the Markovian case, this definition induces a larger set of test functions and reduces to the notion of stochastic viscosity solutions analyzed in [E. Bayraktar and M. Sirbu, Proc. Amer. Math. Soc., 140 (2012), pp. 3645-3654; SIAM J. Control Optim., 51 (2013), pp. 4274-4294]. Our main result takes advantage of this enlargement of the test functions and provides an easier proof of comparison. This is most remarkable in the context of the linear path-dependent heat equation. As a key ingredient for our methodology, we introduce a notion of punctual differentiation, similar to the corresponding concept in the standard viscosity solutions [L. A. Caffarelli and X. Cabre, Amer. Math. Soc. Colloq. Publ., 43, AMS, Providence, RI, 1995], and we prove that semimartingales are almost everywhere punctually differentiable. This smoothness result can be viewed as the counterpart of the Aleksandroff smoothness result for convex functions. A similar comparison result was established earlier in [I. Ekren et al., Ann. Probab., 42 (2014), pp. 204-236]. The result of this paper is more general and, more importantly, the arguments that we develop do not rely on any representation of the solution. [ABSTRACT FROM AUTHOR]

Most undergraduates have limited experience with mathematical modeling. In an effort to respond to various initiatives, such as the recommendations outlined in [S. Garfunkel and M. Montgomery, eds., GAIMME: Guidelines for Assessment & Instruction in Mathematical Modeling Education, SIAM, 2016], this paper describes a course on the mathematical models of cancer growth and treatment. Among its aims is to provide a template for a "bridge" course between the traditional calculus and differential equations sequence and more advanced courses in mathematics and statistics. Prerequisites include a course in ordinary differential equations. Linear algebra is a useful corequisite but no previous programming experience is required. The content includes classical models of tumor growth as well as models for the growth of specific cancer types. Relevant research articles are provided for further study. Material for student projects and effective communication is supplied, as well as suggestions for homework assignments and computer labs. This paper aims to assist instructors in developing their own "Mathematics + Cancer" course. [ABSTRACT FROM AUTHOR]

This paper provides a probabilistic proof of the comparison result for viscosity solutions of path-dependent semilinear PDEs. We consider the notion of viscosity solutions introduced in [I. Ekren, et al., Ann. Probab., 42 (2014), pp. 204-236], which considers as test functions all those smooth processes which are tangent in mean. When restricted to the Markovian case, this definition induces a larger set of test functions and reduces to the notion of stochastic viscosity solutions analyzed in [E. Bayraktar and M. Sirbu, Proc. Amer. Math. Soc., 140 (2012), pp. 3645-3654; SIAM J. Control Optim., 51 (2013), pp. 4274-4294]. Our main result takes advantage of this enlargement of the test functions and provides an easier proof of comparison. This is most remarkable in the context of the linear path-dependent heat equation. As a key ingredient for our methodology, we introduce a notion of punctual differentiation, similar to the corresponding concept in the standard viscosity solutions [L. A. Caffarelli and X. Cabre, Amer. Math. Soc. Colloq. Publ., 43, AMS, Providence, RI, 1995], and we prove that semimartingales are almost everywhere punctually differentiable. This smoothness result can be viewed as the counterpart of the Aleksandroff smoothness result for convex functions. A similar comparison result was established earlier in [I. Ekren et al., Ann. Probab., 42 (2014), pp. 204-236]. The result of this paper is more general and, more importantly, the arguments that we develop do not rely on any representation of the solution. [ABSTRACT FROM AUTHOR]

In this paper we propose a method for computing the Faddeeva function w(z):... erfc(-iz) via truncated modified trapezoidal rule approximations to integrals on the real line. Our starting point is the method due to Matta and Reichel (Math. Comp. 25 (1971), pp. 339-344) and Hunter and Regan (Math. Comp. 26 (1972), pp. 339-541). Addressing shortcomings flagged by Weideman (SIAM. J. Numer. Anal. 31 (1994), pp. 1497-1518), we construct approximations which we prove are exponentially convergent as a function of N+1, the number of quadrature points, obtaining error bounds which show that accuracies of 2x10-15 in the computation of w(z) throughout the complex plane are achieved with N=11, this confirmed by computations. These approximations, moreover, provably achieve small relative errors throughout the upper complex half-plane where w(z) is non-zero. Numerical tests suggest that this new method is competitive, in accuracy and computation times, with existing methods for computing w(z) for complex z [ABSTRACT FROM AUTHOR]

In this paper, through an intuitive vanil la proximal method perspective, we derive a concise unified acceleration framework (UAF) for minimizing a convex function that has H\"older continuous derivatives with respect to general (non-Euclidean) norms. The UAF reconciles two different high-order acceleration approaches, one by Nesterov [Math. Program., 112 (2008), pp. 159-181] and one by Monteiro and Svaiter [SIAM J. Optim., 23 (2013), pp. 1092-1125]. As a result, the UAF unifies the high-order acceleration instances of the two approaches by only two problem-related parameters and two additional parameters for framework design. Meanwhile, the UAF (and its analysis) is the first approach to make high-order methods applicable for high-order smoothness conditions with respect to non-Euclidean norms. Furthermore, the UAF is the first approach that can match the existing lower bound of iteration complexity for minimizing a convex function with H\"older continuous derivatives. For practical implementation, we introduce a new and effective heuristic that significantly simplifies the binary search procedure required by the framework. We use experiments on logistic regression to verify the effectiveness of the heuristic. Finally, the UAF is proposed directly in the general composite convex setting and shows that the existing high-order algorithms can be naturally extended to the general composite convex setting. [ABSTRACT FROM AUTHOR]

For two graphs $F$ and $H$, the relative Turán number ${ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau [SIAM J. Discrete Math., 29 (2015), pp. 65--78] and Perarnau and Reed [Combin. Probab. Comput., 26 (2017), pp. 448--467] studied these quantities as a function of the maximum degree of $H$. In this paper, we study a generalization for uniform hypergraphs. If $F$ is a complete $r$-partite $r$-uniform hypergraph with parts of sizes $s_1,s_2,\dots,s_r$ with each $s_{i + 1}$ sufficiently large relative to $s_i$, then with $1/\beta = \sum_{i = 2}^r \prod_{j = 1}^{i - 1} s_j$ we prove that for any $r$-uniform hypergraph $H$ with maximum degree $\Delta$, ${ex}(H,F)\ge \Delta^{-\beta - o(1)} \cdot e(H).$ This is tight as $\Delta \rightarrow \infty$ up to the $o(1)$ term in the exponent, since we show there exists a $\Delta$-regular $r$-graph $H$ such that ${ex}(H,F)=O(\Delta^{-\beta}) \cdot e(H)$. Similar tight results are obtained when $H$ is the random $n$-vertex $r$-graph $H_{n,p}^r$ with edge-probability $p$, extending results of Balogh and Samotij [J. Lond. Math. Soc., 83 (2011), pp. 1091--1094] and Morris and Saxton [Adv. Math., 298 (2016), pp. 534--580]. General lower bounds for a wider class of $F$ are also obtained. [ABSTRACT FROM AUTHOR]

We consider the Sasa–Satsuma (SS) and nonlinear Schrödinger (NLS) equations posed along the line, in 1 + 1 dimensions. Both equations are canonical integrable U(1) models, with solitons, multi-solitons and breather solutions Yang (2010 SIAM Mathematical Modeling and Computation). For these two equations, we recognize four distinct localized breather modes: the Sasa–Satsuma for SS, and for NLS the Satsuma–Yajima, Kuznetsov–Ma and Peregrine breathers. Very little is known about the stability of these solutions, mainly because of their complex structure, which does not fit into the classical soliton behavior Grillakis et al (1987 J. Funct. Anal. 74 160–97). In this paper we find the natural H2 variational characterization for each of them. This seems to be the first known variational characterization for these solutions; in particular, the first one obtained for the famous Peregrine breather. We also prove that Sasa–Satsuma breathers are H2 nonlinearly stable, improving the linear stability property previously proved by Pelinovsky and Yang (2005 Chaos 15 037115). Moreover, in the SS case, we provide an alternative understanding of the SS solution as a breather, and not only as an embedded soliton. The method of proof is based in the use of a H2 based Lyapunov functional, in the spirit of Alejo and Muńoz (2013 Commun. Math. Phys. 324 233–62), extended this time to the vector-valued case. We also provide another rigorous justification of the instability of the remaining three nonlinear modes (Satsuma–Yajima, Peregrine and Kuznetsov–Ma), based in the study of their corresponding linear variational structure (as critical points of a suitable Lyapunov functional), and complementing the instability results recently proved e.g. in Muńoz (2017 Proyecciones (Antofagasta) 36 653–83). [ABSTRACT FROM AUTHOR]

In this paper, we combine the S-iteration process introduced by Agarwal et al. (J. Nonlinear Convex Anal., 8(1), 61–79 2007) with the proximal point algorithm introduced by Rockafellar (SIAM J. Control Optim., 14, 877–898 1976) to propose a new modified proximal point algorithm based on the S-type iteration process for approximating a common element of the set of solutions of convex minimization problems and the set of fixed points of nearly asymptotically quasi-nonexpansive mappings in the framework of CAT(0) spaces and prove the △-convergence of the proposed algorithm for solving common minimization problem and common fixed point problem. Our result generalizes, extends and unifies the corresponding results of Dhompongsa and Panyanak (Comput. Math. Appl., 56, 2572–2579 2008), Khan and Abbas (Comput. Math. Appl., 61, 109–116 2011), Abbas et al. (Math. Comput. Modelling, 55, 1418–1427 2012) and many more. [ABSTRACT FROM AUTHOR]

In this paper, the author studies the local existence of strong solutions and their possible blow-up in time for a quasilinear system describing the interaction of a short wave induced by an electron field with a long wave representing an extension of the motion of the director field in a nematic liquid crystal's asymptotic model introduced in [Saxton, R. A., Dynamic instability of the liquid crystal director. In: Current Progress in Hyperbolic Systems (Lindquist, W. B., ed.), Contemp. Math., Vol.100, Amer. Math. Soc., Providence, RI, 1989, pp.325–330] and [Hunter, J. K. and Saxton, R. A., Dynamics of director fields, SIAM J. Appl. Math., 51, 1991, 1498–1521] and studied in [Hunter, J. K. and Zheng, Y., On a nonlinear hyperbolic variational equation I, Arch. Rat. Mech. Anal., 129, 1995, 305–353], [Hunter, J. K. and Zheng, Y., On a nonlinear hyperbolic variational equation II, Arch. Rat. Mech. Anal., 129, 1995, 355–383] and in [Zhang, P. and Zheng, Y., On oscillation of an asymptotic equation of a nonlinear variational wave equation, Asymptotic Anal., 18, 1998, 307–327] and, more recently, in [Bressan, A., Zhang, P. and Zheng, Y., Asymptotic variational wave equations, Arch. Rat. Mech. Anal., 183, 2007, 163–185]. [ABSTRACT FROM AUTHOR]

In this paper, we present two nonmonotone versions of adaptive cubic regularized (ARC) method for unconstrained optimization problems. The proposed methods are a combination of the ARC algorithm with the nonmonotone line search methods introduced by Zhang and Hager [A nonmonotone line search technique and its application to unconstrained optimization, SIAM J. Optim. 14 (2004), pp. 1043–1056] and Ahookhosh et al. [A nonmonotone trust-region line search method for large-scale unconstrained optimization, Appl. Math. Model. 36 (2012), pp. 478–487]. The global convergence analysis for these iterative algorithms is established under suitable conditions. Several numerical examples are given to illustrate the efficiency and robustness of the newly suggested methods. The obtained results show the satisfactory performance of the proposed algorithms when compared to the basic ARC algorithm. [ABSTRACT FROM AUTHOR]

M. A. Henning and A. Yeo conjectured in [SIAM J. Discrete Math., 26 (2012), pp. 687{694] that a bipartite digraph of minimum out-degree at least 3 contains two vertex disjoint directed cycles of different lengths. In this paper, we disprove this conjecture. Further, we classify strong tournaments and strong bipartite tournaments of minimum out-degree 3 without two vertex disjoint directed cycles of different lengths. [ABSTRACT FROM AUTHOR]

Litvak-Hinenzon et al. developed the phenomenological model to simulate the horizontal motion of particles in the atmosphere, and a series of their papers (see e.g., Litvak-Hinenzon et al. (Phys. D 164:213-250, 2002; Nonlinearity 15:1149-1177, 2002; SIAM J. Appl. Dyn. Syst. 3:525-573, 2004)) focused on studying the fate of parabolic resonance lower dimensional tori (as part of a quasi-periodic Hamiltonian pitchfork bifurcation (HPB) scenario in the unperturbed phenomenological model) under perturbations. However, the structural stability of quasi-periodic HPB involved therein has not been fully exposed theoretically (Litvak-Hinenzon et al. have only given some numerical explanations). Based on BCKV singularity theory established by Broer et al. (Z. Angew. Math. Phys. 44:389-432, 1993), we consider a more general quasi-periodic HPB triggered by the Z 2 -invariant universal unfolding N b c k v = a y 2 2 − (λ + b I 1) x 2 2 + c x 4 4 with respect to Z 2 -equivariant BCKV-restricted morphisms of the planar singularity a 2 y 2 + c 4 x 4 (the coefficients a , b , c ≠ 0 , the I 1 is regarded as distinguished parameter with respect to the external parameter λ). We prove a KAM (Kolmogorov–Arnold–Moser) theorem concerning parabolic tori in such quasi-periodic HPB, by which Diophantine parabolic tori (and the whole corresponding Diophantine HPB scenario) survive non-integrable and Z 2 -invariant Hamiltonian perturbations, parametrized by pertinent large Cantor sets. In the context of Z 2 -symmetry, our results can be seen as rigorous proof of the structural stability problem of bifurcations of Floquet-tori triggered by the universal unfolding N b c k v with distinguished parameters which is proposed by Broer et al. (Z. Angew. Math. Phys. 44:389-432, 1993). Ultimately, we similarly obtain the structural stability result of quasi-periodic HPB in the phenomenological model mentioned above, which can be utilized as a starting point for a deeper understanding of the various resonances and chaotic dynamics (in the gaps of the Cantor sets), just as Litvak-Hinenzon et al. did for normally parabolic tori undergoing a HPB. • We prove a KAM theorem in a quasi-periodic Hamiltonian pitchfork bifurcation. • We obtain the structural stability of a bifurcation in a phenomenological model. • We verify some of the previous numerical phenomena of Litvak-Hinenzon et al. [ABSTRACT FROM AUTHOR]

A graph is said to be open-neighborhood conflict-free k-colorable if there exists an assignment of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among the neighbors of v. The open-neighborhood conflict-free chromatic number χO(G) is the smallest k for which G is open-neighborhood conflict-free k-colorable. Z. Abel et al., [SIAM J. Discrete Math. 32 (2018), pp. 2675--2702] showed that χ O(G) ≤ 8 for every planar graph G and posed two open problems to ask whether χO(G) \leq 4 for every planar graph G and whether χO(G) ≤ 3 for every outerplanar graph G. We present in this paper positive answers for the above two open problems by establishing a stronger result which states that, for every integer k ≥ 2, every minor-k-colorable graph is open-neighborhood conflict-free k-colorable, where a graph G is said to be minor-k-colorable if every minor of G is k-colorable. [ABSTRACT FROM AUTHOR]

For a graph G = (V,E), a hypergraph H is called a Berge-G if there is a bijection f : E(G) → E(H) such that e ⊆ f(e) for all e ∈ E(G). The family of Berge-G hypergraphs is denoted by B(G). The maximum number of edges in an n-vertex r-graph with no subhypergraph isomorphic to any Berge-G is denoted by exr(n, B (G)). Gyárfás [SIAM J. Discrete Math., 33 (2019), pp. 383-- 392] showed that for n ≥ 6, ex3(n, B (K4)) = [n/3] [n+1/3] [n+2/3]. However, we found an error in the proof of the result when n ≥ 7. A recent result due to Gerbner, Methuku, and Palmer [European J. Combin., 86 (2020), 103082] implies that for n ≥ 9, ex3(n, B (K4)) = [n/3] [n+1/3] [n+2/3]. In this paper we prove the remaining cases n = 7 and n = 8 for the completeness of the conclusion. [ABSTRACT FROM AUTHOR]

This paper aims to provide a robust model for the well-known phenomenon of Kármán vortex street arising in fluid mechanics. The first theoretical attempt to model this pattern was given by von Kármán (1991 Göttinger Nachr., Math. Phys. Kl. 509–17); von Kármán (1912 Göttinger Nachr., Math. Phys. Kl. 547–56). He considered two parallel staggered rows of point vortices, with opposite strength, that translate at the same speed. Following the ideas of Saffman and Schatzman (1981 SIAM J. Sci. Stat. Comput. 2 285–95), we propose to study this phenomenon in the Euler equations by considering two infinite arrows of vortex patches. The key idea is to desingularize the point vortex model proposed by von Kármán. Our construction is flexible and can be extended to more general incompressible models. [ABSTRACT FROM AUTHOR]

This paper considers a system of two conservation laws with a Lipschitz continuous flow and deals with solutions to the Cauchy problems at a node. The system considered is the two-phase traffic model, proposed in [R. M. Colombo, F. Marcellini, and M. Rascle, SIAM J. Appl. Math., 70 (2010), pp. 2652--2666]. We are able to provide global in time existence of solutions at a node with a single incoming road and m outgoing roads. Neither assumptions on the smallness of the total variation of initial data are required, as usual in the case of systems, nor on the range of the initial data. [ABSTRACT FROM AUTHOR]

One important task in image segmentation is to find a region of interest, which is, in general, a solution of a nonlinear and nonconvex problem. The authors of Chan and Esedoglu (Aspects of total variation regularized L 1 function approximation. SIAM J. Appl. Math. 2005;65:1817–1837) proposed a convex T V − L 1 problem for finding such a region Σ and proved that when a binary input f is given, a solution u ∗ to the convex problem gives rise to other solutions 1 { u ∗ ≥ μ } for a.e. μ ∈ (0 , 1) from which they raised a question of whether or not u ∗ must be binary. The same is to ask if the two-phase Mumford–Shah model in image processing has a unique solution with a binary input. In this paper, we will discuss how to construct a non-binary solution that provides a negative answer to the question through a connection of two ideas, one from the two-phase Mumford–Shah model in image segmentation and the other from mean curvature motions discussed in some geometric problems (e.g. Alter, Caselles, Chambolle. A characterization of convex calibrable sets in R N . Math. Ann. 2005;322:329–366; Chambolle. An algorithm for mean curvature motion. Interfaces Free Boundaries 2004;6:195–218) revealing the nature of non-uniqueness in image segmentation. [ABSTRACT FROM AUTHOR]

An implicit-explicit multistep method based on the backward difference formulae (BDF) is proposed for time discretization of parabolic equations with a non-self-adjoint operator. Implicit and explicit schemes are used for the self-adjoint and anti-self-adjoint parts of the operator, respectively. For a k-step method, some correction terms are added to the starting k - 1 steps to maintain kth-order convergence without imposing further compatibility conditions at the initial time. Long-time kth-order convergence for the numerical method is proved under the assumptions that the operator is coercive and that the non-self-adjoint part is low order. Such an operator often appears in practical computation (such as the Stokes--Darcy system) but may violate the standard sectorial angle condition used in the literature for analysis of BDF. In particular, the proposed method and analysis in this paper extend the long-time energy error analysis of the Stokes--Darcy system in Chen et al. [SIAM J. Numer. Anal., 51 (2013), pp. 2563--2584; Numer. Math., 134 (2016), pp. 857--879] to general symmetrized and decoupled BDF methods up to order 6 by using the generating function technique. [ABSTRACT FROM AUTHOR]

A cut varepsilon-sparsifier of a weighted graph G is a reweighted subgraph of G of (quasi)linear size that preserves the size of all cuts up to a multiplicative factor of varepsilon. Since their introduction by Benczur and Karger [Approximating s-t minimum cuts in O~ (n2) time, in Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (STOC96), 1996, pp. 47-55], cut sparsifiers have proved extremely influential and found various applications. Going beyond cut sparsifiers, Filtser and Krauthgamer [SIAM J. Discrete Math., 31 (2017), pp. 1263--1276] gave a precise classification of which binary Boolean CSPs are sparsifiable. In this paper, we extend their result to binary CSPs on arbitrary finite domains. [ABSTRACT FROM AUTHOR]

A queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, so that no two independent edges of the same queue are nested. The queue number of a graph is the minimum number of queues required by any of its queue layouts. A long-standing conjecture by Heath, Leighton and Rosenberg [SIAM J. Discrete Math., 5 (1992), pp. 398--412] states that the queue number of planar graphs is bounded. This conjecture has been partially settled in the positive for several subfamilies of planar graphs (most of which have bounded treewidth). In this paper, we make a further important step towards settling this conjecture. We prove that planar graphs of bounded degree (which may have unbounded treewidth) have bounded queue number. A notable implication of this result is that every planar graph of bounded degree admits a three-dimensional straight-line grid drawing in linear volume. Further implications are that every planar graph of bounded degree has bounded track number, and that every k-planar graph (i.e., every graph that can be drawn in the plane with at most k crossings per edge) of bounded degree has bounded queue number. [ABSTRACT FROM AUTHOR]

A graph G is called (2,k)‐connected if G is 2k‐edge‐connected and G−v is k‐edge‐connected for every vertex v. The study of (2,2)‐connected graphs is motivated by a theorem of Thomassen [J. Combin. Theory Ser. A 110 (2015), pp. 67–78] (that was a conjecture of Frank [SIAM J. Discrete Math. 5 (1992), no. 1, pp. 25–53]), which states that a graph has a 2‐vertex‐connected orientation if and only if it is (2,2)‐connected. In this paper, we provide a construction of the family of (2,k)‐connected graphs for k even, which generalizes the construction given by Jordán [J. Graph Theory 52 (2006), pp. 217–229] for (2,2)‐connected graphs. We also solve the corresponding connectivity augmentation problem: given a graph G and an integer k≥2, what is the minimum number of edges to be added to make G(2,k)‐connected. Both these results are based on a new splitting‐off theorem for (2,k)‐connected graphs. [ABSTRACT FROM AUTHOR]

Targeted environmental and ecosystem management remain crucial in control of dengue. However, providing detailed environmental information on a large scale to effectively target dengue control efforts remains a challenge. An important piece of such information is the extent of the presence of potential dengue vector breeding sites, which consist primarily of open containers such as ceramic jars, buckets, old tires, and flowerpots. In this paper we present the design and implementation of a pipeline to detect outdoor open containers which constitute potential dengue vector breeding sites from geotagged images and to create highly detailed container density maps at unprecedented scale. We implement the approach using Google Street View images which have the advantage of broad coverage and of often being two to three years old which allows correlation analyses of container counts against historical data from manual surveys. Containers comprising eight of the most common breeding sites are detected in the images using convolutional neural network transfer learning. Over a test set of images the object recognition algorithm has an accuracy of 0.91 in terms of F-score. Container density counts are generated and displayed on a decision support dashboard. Analyses of the approach are carried out over three provinces in Thailand. The container counts obtained agree well with container counts from available manual surveys. Multi-variate linear regression relating densities of the eight container types to larval survey data shows good prediction of larval index values with an R-squared of 0.674. To delineate conditions under which the container density counts are indicative of larval counts, a number of factors affecting correlation with larval survey data are analyzed. We conclude that creation of container density maps from geotagged images is a promising approach to providing detailed risk maps at large scale. [ABSTRACT FROM AUTHOR]

This erratum clarifies that equations (4.21) and (4.23) in Böttcher and Porter [SIAM J. Appl. Math., 81 (2021), pp. 2704-2724] assume that the underlying evolution operator has an orthonormal basis. The results and conclusions of the paper are unaffected by this clarification. [ABSTRACT FROM AUTHOR]

A variety of powerful extremal results have been shown for the chromatic number of triangle-free graphs. Three noteworthy bounds are in terms of the number of vertices, edges, and maximum degree given by Poljak and Tuza [SIAM J. Discrete Math., 7 (1994), pp. 307--313] and Johansson. There have been comparatively fewer works extending these types of bounds to graphs with a small number of triangles. One noteworthy exception is a result of Alon, Krivelevich, and Sudakov [J. Combin. Theory Ser. B, 77 (1999), pp. 73--82] bounding the chromatic number for graphs with low degree and few triangles per vertex; this bound is nearly the same as for triangle-free graphs. This type of parametrization is much less rigid and has appeared in dozens of combinatorial constructions. In this paper, we show a similar type of result for X (G) as a function of the number of vertices n, the number of edges m, as well as the triangle count (both local and global measures). Our results smoothly interpolate between the generic bounds true for all graphs and bounds for triangle-free graphs. Our results are tight for most of these cases; we show how an open problem regarding fractional chromatic number and degeneracy in triangle-free graphs can resolve the small remaining gap in our bounds. [ABSTRACT FROM AUTHOR]

This note is an erratum for the paper On the Inequalities of Projected Volumes and the Constructible Region [SIAM J. Discrete Math., 33 (2019), pp. 694--711]. There is a mistake in the proof of Theorem 4 in Section 3. However, Theorem 4 is itself correct (a proof can be found in [Inequalities on Projected Volumes, arxiv.org/abs/1909.12858, 2019] by Leader, Randelovic, and Raty), and all the other results of the paper stand. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we introduce the notion of the fractional weak discrepancy of a poset, building on previous work on weak discrepancy in [J.G. Gimbel and A.N. Trenk, On the weakness of an ordered set, SIAM J. Discrete Math. 11 (1998) 655–663; P.J. Tanenbaum, A.N. Trenk, P.C. Fishburn, Linear discrepancy and weak discrepancy of partially ordered sets, ORDER 18 (2001) 201–225; A.N. Trenk, On k-weak orders: recognition and a tolerance result, Discrete Math. 181 (1998) 223–237]. The fractional weak discrepancy of a poset is the minimum nonnegative k for which there exists a function satisfying (1) if then and (2) if then . We formulate the fractional weak discrepancy problem as a linear program and show how its solution can also be used to calculate the (integral) weak discrepancy. We interpret the dual linear program as a circulation problem in a related directed graph and use this to give a structural characterization of the fractional weak discrepancy of a poset. [Copyright &y& Elsevier]

Abstract: The purpose of this paper is to provide the convergence theory for the iterative approach given by M.T. Chu [Numerical methods for inverse singular value problems, SIAM J. Numer. Anal. 29 (1992), pp. 885–903] in the context of solving inverse singular value problems. We provide a detailed convergence analysis and show that the ultimate rate of convergence is quadratic in the root sense. Numerical results which confirm our theory are presented. It is still an open issue to prove that the method is Q-quadratic convergent as claimed by M.T. Chu. [Copyright &y& Elsevier]