Search

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs. Moreover, we extend the definition of approximately pseudo-dissipative in the setting of metrizable topological vector spaces.

In this work, we describe a new approach that uses deep neural networks (DNN) to obtain regularization parameters for solving inverse problems. We consider a supervised learning approach, where a network is trained to approximate the mapping from observation data to regularization parameters. Once the network is trained, regularization parameters for newly obtained data can be computed by efficient forward propagation of the DNN. We show that a wide variety of regularization functionals, forward models, and noise models may be considered. The network-obtained regularization parameters can be computed more efficiently and may even lead to more accurate solutions compared to existing regularization parameter selection methods. We emphasize that the key advantage of using DNNs for learning regularization parameters, compared to previous works on learning via optimal experimental design or empirical Bayes risk minimization, is greater generalizability. That is, rather than computing one set of parameters that is optimal with respect to one particular design objective, DNN-computed regularization parameters are tailored to the specific features or properties of the newly observed data. Thus, our approach may better handle cases where the observation is not a close representation of the training set. Furthermore, we avoid the need for expensive and challenging bilevel optimization methods as utilized in other existing training approaches. Numerical results demonstrate the potential of using DNNs to learn regularization parameters., 27 pages, 16 figures

International audience; This article studies the kinetic dynamics of the rock-paper-scissors binary game. We first prove existence and uniqueness of the solution of the kinetic equation and subsequently we prove the rigorous derivation of the quasi-invariant limit for two meaningful choices of the domain of definition of the independent variables. We notice that the domain of definition of the problem plays a crucial role and heavily influences the behavior of the solution. The rigorous proof of the relaxation limit does not need the use of entropy estimates for ensuring compactness.

In (2012), Leonetti and Siepe [10] considered solutions to boundary value problems of some anisotropic elliptic equations of the type { ∑ i = 1 n D i ( a i ( x , D u ( x ) ) ) = 0 , x ∈ Ω , u ( x ) = θ ( x ) , x ∈ ∂ Ω . Under some suitable conditions, they obtained an integrability result, which shows that higher integrability of the boundary datum θ forces solutions u to have higher integrability as well. In the present paper, we consider K ψ , θ ( p i ) -obstacle problems of the nonhomogeneous anisotropic elliptic equations ∑ i = 1 n D i ( a i ( x , D u ( x ) ) ) = ∑ i = 1 n D i f i ( x ) under some controllable growth and monotonicity conditions. We obtain an integrability result, which can be regarded as a generalization of the result due to Leonetti and Siepe.

Leonetti proved that whenever $${\mathcal {I}}$$ is an ideal on $${\mathbb {N}}$$ such that there exists an uncountable family of sets that are not in $${\mathcal {I}}$$ with the property that the intersection of any two distinct members of that family is in $${\mathcal {I}}$$ , then the space $$c_{0,{\mathcal {I}}}$$ of sequences in $$\ell _\infty $$ that converge to 0 along $${\mathcal {I}}$$ is not complemented. We provide a shorter proof of a more general fact that the quotient space $$\ell _\infty / c_{0,{\mathcal {I}}}$$ does not even embed into $$\ell _\infty $$ .

In Fritz John's famous paper (1979), he discovered that for the wave equation $\Box u=|u|^p$, where $1, Comment: 11 pages, 3 figures

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

We show that a relative entropy condition recently shown by Leger and Vasseur to imply uniqueness and stable $L^2$ dependence on initial data of Lax 1- or $n$-shock solutions of an $n\times n$ system of hyperbolic conservation laws with convex entropy implies Lopatinski stability in the sense of Majda. This means in particular that Leger and Vasseur's relative entropy condition represents a considerable improvement over the standard entropy condition of decreasing shock strength and increasing entropy along forward Hugoniot curves, which, in a recent example exhibited by Barker, Freist\"uhler and Zumbrun, was shown to fail to imply Lopatinski stability, even for systems with convex entropy. This observation bears also on the parallel question of existence, at least for small $BV$ or $H^s$ perturbations, Comment: to appear in Proceedings of the AMS

In a series of papers which are either published [A.R. Hadjesfandiari and G.F. Dargush, Couple stress theory for solids, Int. J. Solids Struct. 48, 2496-2510, 2011; A.R. Hadjesfandiari and G.F. Dargush, Fundamental solutions for isotropic size-dependent couple stress elasticity, Int. J. Solids Struct. 50, 1253-1265, 2013] or available as preprints Hadjesfandiari and Dargush have reconsidered the linear indeterminate couple stress model. They are postulating a certain physically plausible split in the virtual work principle. Based on this postulate they claim that the second-order couple stress tensor must always be skew-symmetric. Since they use an incomplete set of boundary conditions in their virtual work principle their statement contains unrecoverable errors. This is shown by specifying their development to the isotropic case. However, their choice of constitutive parameters is mathematically possible and still yields a well-posed boundary value problem., arXiv admin note: text overlap with arXiv:1504.00868

In this short paper, using category theory, we argue that logical rules can be seen as fractions and logics as limit sketches.

We study linear inverse problems under the premise that the forward operator is not at hand but given indirectly through some input-output training pairs. We demonstrate that regularization by projection and variational regularization can be formulated by using the training data only and without making use of the forward operator. We study convergence and stability of the regularized solutions in view of Seidman (1980 J. Optim. Theory Appl. 30 535), who showed that regularization by projection is not convergent in general, by giving some insight on the generality of Seidman’s nonconvergence example. Moreover, we show, analytically and numerically, that regularization by projection is indeed capable of learning linear operators, such as the Radon transform.

We take up a recently proposed compartmental SEIQR model with delays, ignore loss of immunity in the context of a fast pandemic, extend the model to a network structured on infectivity and consider the continuum limit of the same with a simple separable interaction model for the infectivities \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}β. Numerical simulations show that the evolving dynamics of the network is effectively captured by a single scalar function of time, regardless of the distribution of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}β in the population. The continuum limit of the network model allows a simple derivation of the simpler model, which is a single scalar delay differential equation (DDE), wherein the variation in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}β appears through an integral closely related to the moment generating function of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$u=\sqrt{\beta }$$\end{document}u=β. If the first few moments of u exist, the governing DDE can be expanded in a series that shows a direct correspondence with the original compartmental DDE with a single \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}β. Even otherwise, the new scalar DDE can be solved using either numerical integration over u at each time step, or with the analytical integral if available in some useful form. Our work provides a new academic example of complete dimensional collapse, ties up an underlying continuum model for a pandemic with a simpler-seeming compartmental model and will hopefully lead to new analysis of continuum models for epidemics.

In this short paper, we show how to deduce several types of generating functions from Srivastava {\it et al} [Appl. Set-Valued Anal. Optim. {\bf 1} (2019), pp. 187-201.] by the method of $q$-difference equations. Moreover, we build relations between transformation formulas and homogeneous $q$-difference equations., 10

The identification of the right order of the equation in applied fractional modeling plays an important role. In this paper we consider an inverse problem for determining the order of time fractional derivative in a subdiffusion equation with an arbitrary second order elliptic differential operator. We prove that the additional information about the solution at a fixed time instant at a monitoring location, as "the observation data", identifies uniquely the order of the fractional derivative., Comment: Version 1

We prove the existence of free objects in certain subcategories of Banach lattices, including p-convex Banach lattices, Banach lattices with upper p-estimates, and AM-spaces. From this we immediately deduce that projectively universal objects exist in each of these subcategories, extending results of Leung, Li, Oikhberg and Tursi (Israel J. Math. 2019). In the p-convex and AM-space cases, we are able to explicitly identify the norms of the free Banach lattices, and we conclude by investigating the structure of these norms in connection with nonlinear p-summing maps., g Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. P. Tradacete gratefully acknowledges support by Agencia Estatal de Investigación (AEI) and Fondo Europeo de Desarrollo Regional (FEDER) through grants PID2020-116398GB-I00, MTM2016-76808-P, and MTM2016- 75196-P, as well as Spanish Ministry of Science and Innovation, through the “Severo Ochoa Programme for Centres of Excellence in R&D” (CEX2019-000904-S) and from Consejo Superior de Investigaciones Científicas (CSIC), through “Ayuda extraordinaria a Centros de Excelencia Severo Ochoa” (20205CEX001). H. Jardón-Sánchez gratefully acknowledges support by Fundación María Cristina Masaveu Peterson through its Scholarships for Academic Excellence and Fundación “la Caixa” through its Postgraduate Studies in Europe Fellowships. V.G. Troitsky gratefully acknowledges support by Natural Sciences and Engineering Research Council of Canada

The unified transform method (UTM) provides a novel approach to the analysis of initial-boundary value problems for linear as well as for a particular class of nonlinear partial differential equations called integrable. If the latter equations are formulated in two dimensions (either one space and one time, or two space dimensions), the UTM expresses the solution in terms of a matrix Riemann-Hilbert (RH) problem with explicit dependence on the independent variables. For nonlinear integrable evolution equations, such as the celebrated nonlinear Schr\"odinger (NLS) equation, the associated jump matrices are computed in terms of the initial conditions and all boundary values. The unknown boundary values are characterized in terms of the initial datum and the given boundary conditions via the analysis of the so-called global relation. In general, this analysis involves the solution of certain nonlinear equations. In certain cases, called linearizable, it is possible to bypass this nonlinear step. In these cases, the UTM solves the given initial-boundary value problem with the same level of efficiency as the well-known inverse scattering transform solves the initial value problem on the infinite line. We show here that the initial-boundary value problem on a finite interval with $x$-periodic boundary conditions (which can alternatively be viewed as the initial value problem on a circle), belongs to the linearizable class. Indeed, by employing certain transformations of the associated RH problem and by using the global relation, the relevant jump matrices can be expressed explicitly in terms of the so-called scattering data, which are computed in terms of the initial datum. Details are given for NLS, but similar considerations are valid for other well-known integrable evolution equations, including the Korteweg-de Vries (KdV) and modified KdV equations., Comment: 14 pages, includes announcements of results in arXiv:2103.04728

In an attempt to understand the soliton resolution conjecture, we consider the Sine-Gordon equation on a spherically symmetric wormhole spacetime. We show that within each topological sector (indexed by a positive integer degree $n$) there exists a unique linearly stable soliton, which we call the $n$-kink. We give numerical evidence that the $n$-kink is a global attractor in the evolution of any smooth, finite energy solutions of degree $n$. When the radius of the wormhole throat $a$ is large enough, the convergence to the $n$-kink is shown to be governed by internal modes that slowly decay due to the resonant transfer of energy to radiation. We compute the exact asymptotics of this relaxation process for the $1$-kink using the Soffer-Weinstein weakly nonlinear perturbation theory., Comment: 19 pages, 10 figures, final version

Using various techniques from dynamical systems theory, we rigorously study an experimentally validated model by [Barkley et al 2015 Nature 526 550–3], which describes the rise of turbulent pipe flow via a PDE system of reduced complexity. The fast evolution of turbulence is governed by reaction-diffusion dynamics coupled to the centerline velocity, which evolves with advection of Burgers’ type and a slow relaminarization term. Applying to this model a spatial dynamics ansatz and geometric singular perturbation theory, we prove the existence of a heteroclinic loop between a turbulent and a laminar steady state and establish a cascade of bifurcations of various traveling waves mediating the transition to turbulence. The most complicated behaviour can be found in an intermediate Reynolds number regime, where the traveling waves exhibit arbitrarily long periodic-like dynamics indicating the onset of chaos. Our analysis provides a systematic mathematical approach to identifying the transition to spatio–temporal turbulent structures that may also be applicable to other models arising in fluid dynamics.

Strain engineering is used to obtain desirable materials properties in a range of modern technologies. Direct nanoscale measurement of the three-dimensional strain tensor field within these materials has however been limited by a lack of suitable experimental techniques and data analysis tools. Scanning electron diffraction has emerged as a powerful tool for obtaining two-dimensional maps of strain components perpendicular to the incident electron beam direction. Extension of this method to recover the full three-dimensional strain tensor field has been restricted though by the absence of a formal framework for tensor tomography using such data. Here, we show that it is possible to reconstruct the full non-symmetric strain tensor field as the solution to an ill-posed tensor tomography inverse problem. We then demonstrate the properties of this tomography problem both analytically and computationally, highlighting why incorporating precession to perform scanning precession electron diffraction may be important. We establish a general framework for non-symmetric tensor tomography and demonstrate computationally its applicability for achieving strain tomography with scanning precession electron diffraction data.

Funder: John Simon Guggenheim Memorial Foundation; doi: https://doi.org/10.13039/100005851, In this work we study the global solvability of the primitive equations for the atmosphere coupled to moisture dynamics with phase changes for warm clouds, where water is present in the form of water vapor and in the liquid state as cloud water and rain water. This moisture model contains closures for the phase changes condensation and evaporation, as well as the processes of auto conversion of cloud water into rainwater and the collection of cloud water by the falling rain droplets. It has been used by Klein and Majda in [17] and corresponds to a basic form of the bulk microphysics closure in the spirit of Kessler [16] and Grabowski and Smolarkiewicz [12]. The moisture balances are strongly coupled to the thermodynamic equation via the latent heat associated to the phase changes. In [14] we assumed the velocity field to be given and proved rigorously the global existence and uniqueness of uniformly bounded solutions of the moisture balances coupled to the thermodynamic equation. In this paper we present the solvability of a full moist atmospheric flow model, where the moisture model is coupled to the primitive equations of atmospherical dynamics governing the velocity field. For the derivation of a priori estimates for the velocity field we thereby use the ideas of Cao and Titi [6], who succeeded in proving the global solvability of the primitive equations.

We show that the space $\mathcal{S}'(\Gamma)$ of Laplace transformable distributions, where $\Gamma \subseteq \mathbb{R}^d$ is a non-empty convex open set, is an ultrabornological (PLS)-space. Moreover, we determine an explicit topological predual of $\mathcal{S}'(\Gamma)$., Comment: 10 pages

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

In this work we introduce the r-Hunter-Saxton equation, a generalisation of the Hunter-Saxton equation arising as extremals of an action principle posed in L_r. We characterise solutions to the Cauchy problem, quantifying the blow-up time and studying various symmetry reductions. We construct piecewise linear functions and show that they are weak solutions to the r-Hunter-Saxton equation., Revised after referee comments

In this short paper we establish the global well-posedness of strong solutions to the 3D full compressible Navier–Stokes system with vacuum in a bounded domain Ω ⊂ R 3 by the bootstrap argument provided that the viscosity coefficients λ and μ satisfy that 7 λ > 9 μ and the initial data ρ 0 and u 0 satisfy that ‖ ρ 0 ‖ L ∞ ( Ω ) and ‖ ρ 0 | u 0 | 5 ‖ L 1 ( Ω ) are sufficiently small.

In this short paper, we establish a range of Caffarelli-Kohn-Nirenberg and weighted $L^{p}$-Sobolev type inequalities on stratified Lie groups. All inequalities are obtained with sharp constants. Moreover, the equivalence of the Sobolev type inequality and Hardy inequality is shown in the $L^{2}$-case., to appear in NoDEA

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We derive conditions on the diffusion coefficients which permit transition probabilities to match locally first and second moments. We derive a novel formula which expresses how the matching becomes more difficult for larger (absolute) correlations and strongly anisotropic processes, such that instantaneous moves to more distant neighbours on the lattice have to be allowed. Roughly speaking, for non-zero correlations, the distance covered in one timestep is proportional to the ratio of volatilities in the two directions. We discuss the implications to Markov decision processes and the convergence analysis of approximations to Hamilton-Jacobi-Bellman equations in the Barles-Souganidis framework., Corrected two errata from previous and journal version: definition of R in (5) and summations in (7)

The purpose of this short paper is to show the invalidity of a Fourier series expansion of fractional order as derived by G. Jumarie in a series of papers. In his work the exponential functions einωx are replaced by the Mittag-Leffler functions Eα (i(nωx)α) , over the interval [0,Mα/ω] where 0 < ω < ∞ and Mα > 0 is the period of the function Eα (ixα) , i.e., Eα (ixα) = Eα (i(x +Mα)α) . He showed that any smooth periodic function f with period Mα/ω can be expanded in a Fourier-type series. We will show that the only possible period of the function Eα (ixα) is Mα = 0; hence the invalidity of any Fourier-type series expansion of f.

Using Wilf-Zeilberger algorithmic proof theory, we continue pioneering work of Meni Rosenfeld (followed up by interesting work by Cyril Grunspan and Ricardo Perez-Marco) and study the probability and duration of successful bitcoin attacks, but using an equivalent, and much more congenial, formulation as a certain two-phase soccer match., 8 pages; Accompanied by a Maple package and outputs filed obtainable from http://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/bitcoin.html (Added: proof provenance about the negative binomial distribution.)

This is a comment on the article mentioned in the title.

Let $G=(V,E)$ be a connected finite graph. In this short paper, we reinvestigate the Kazdan-Warner equation $$\Delta u=c-he^u$$ with $cc>c_-(h)$ and it is not solvable for $c-\infty$, then there exists at least one solution to the Kazdan-Warner equation with $c=c_-(h)$., Comment: 7 pages

In 1985, Odoni showed that in characteristic 0 0 the Galois group of the n n -th iterate of the generic polynomial with degree d d is as large as possible. That is, he showed that this Galois group is the n n -th wreath power of the symmetric group S d S_d . We generalize this result to positive characteristic, as well as to the generic rational function. These results can be applied to prove certain density results in number theory, two of which are presented here. This work was partially completed by the late R.W.K. Odoni in an unpublished paper.

We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM algorithm that is able to handle convex optimization problems involving an additional smooth function in its objective, and which is evaluated through its gradient. Moreover, in each iteration we allow the use of variable metrics, while the investigations are carried out in the setting of infinite dimensional Hilbert spaces. This algorithmic scheme is investigated from the point of view of its convergence properties., Comment: Updates in Section 2 concerning the derivation of the convergence rates + a unifying convergence theorem for the sequence of iterates

In previous work the authors defined the k-th order simplicial distance between probability distributions which arises naturally from a measure of dispersion based on the squared volume of random simplices of dimension k. This theory is embedded in the wider theory of divergences and distances between distributions which includes Kullback–Leibler, Jensen–Shannon, Jeffreys–Bregman divergence and Bhattacharyya distance. A general construction is given based on defining a directional derivative of a function $$\phi $$ from one distribution to the other whose concavity or strict concavity influences the properties of the resulting divergence. For the normal distribution these divergences can be expressed as matrix formula for the (multivariate) means and covariances. Optimal experimental design criteria contribute a range of functionals applied to non-negative, or positive definite, information matrices. Not all can distinguish normal distributions but sufficient conditions are given. The k-th order simplicial distance is revisited from this aspect and the results are used to test empirically the identity of means and covariances.

An {\em orientation} of an undirected graph $G$ is an assignment of exactly one direction to each edge of $G$. Converting two-way traffic networks to one-way traffic networks and bidirectional communication networks to unidirectional communication networks are practical instances of graph orientations. In these contexts minimising the diameter of the resulting oriented graph is of prime interest. The $n$-star network topology was proposed as an alternative to the hypercube network topology for multiprocessor systems by Akers and Krishnamurthy [IEEE Trans. on Computers (1989)]. The $n$-star graph $S_n$ consists of $n!$ vertices, each labelled with a distinct permutation of $[n]$. Two vertices are adjacent if their labels differ exactly in the first and one other position. $S_n$ is an $(n-1)$-regular, vertex-transitive graph with diameter $\lfloor 3(n-1)/2 \rfloor$. Orientations of $S_n$, called unidirectional star graphs and distributed routing protocols over them were studied by Day and Tripathi [Information Processing Letters (1993)] and Fujita [The First International Symposium on Computing and Networking (CANDAR 2013)]. Fujita showed that the (directed) diameter of this unidirectional star graph $\overrightarrow{S_n}$ is at most $\lceil{5n/2}\rceil + 2$. In this paper, we propose a new distributed routing algorithm for the same $\overrightarrow{S_n}$ analysed by Fujita, which routes a packet from any node $s$ to any node $t$ at an undirected distance $d$ from $s$ using at most $\min\{4d+4, 2n+4\}$ hops. This shows that the (directed) diameter of $\overrightarrow{S_n}$ is at most $2n+4$. We also show that the diameter of $\overrightarrow{S_n}$ is at least $2n$ when $n \geq 7$, thereby showing that our upper bound is tight up to an additive factor., Full version of the paper to be presented in CALDAM 2020

Part of the work was done while the authors were visiting the South China University of Science and Technology (SUSTech), Shenzhen, in 2018, and we are grateful (in particular to Professor Cai Heng Li) for the hospitality that we received.The authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no.EP/R014604/1), where further work on this paper was undertaken. In particular we acknowledge a Simons Fellowship (Cameron) and a Kirk Distinguished Visiting Fellowship (Praeger) during this programme. Schneider thanks the Centre for the Mathematics of Symmetry and Computation of The University of Western Australia and Australian Research Council Discovery Grant DP160102323 for hosting his visit in 2017 and acknowledges the support of the CNPq projects Produtividade em Pesquisa (project no.: 308212/2019-3) and Universal (project no.:421624/2018-3). Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied in general. The main purpose of this paper is to describe and characterise such structures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan-Scott theorem, which are defined over finite characteristically simple groups, our construction works over arbitrary groups, finite or infinite. A diagonal semilattice depends on a dimension m and a group T. For m=2, it is a Latin square, the Cayley table of T, though in fact any Latin square satisfies our combinatorial axioms. However, for m≥3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in great profusion but higher-dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set Ω, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions turn out to be equivalent for diagonal groups). Associated with the diagonal semilattice is a graph, the diagonal graph, which has the same automorphism group as the diagonal semilattice except in four small cases with m

In this paper, we investigate the relationships between proper efficiency and the solutions of a general scalarization problem in multi-objective optimization. We provide some conditions under which the solutions of the dealt with scalar program are properly efficient and vice versa. We also show that, under some conditions, if the considered general scalar problem is unbounded, then the original multi-objective problem does not have any properly efficient solution. In another part of the work, we investigate a general transformation of the objective functions which preserves proper efficiency. We show that several important results existing in the literature are direct consequences of the results of the present paper.

The aim of this paper is twofold. The first is to study the asymptotics of a parabolically scaled, continuous and space-time stationary in time version of the well-known Funaki-Spohn model in Statistical Physics. After a change of unknowns requiring the existence of a space-time stationary eternal solution of a stochastically perturbed heat equation, the problem transforms to the qualitative homogenization of a uniformly elliptic, space-time stationary, divergence form, nonlinear partial differential equation, the study of which is the second aim of the paper. An important step is the construction of correctors with the appropriate behavior at infinity.

A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality) with positive coefficients. These combinatorial notions have many applications and are motivated by the theory of Boolean functions and integer programming. We introduce in this paper the class of $1$-Sperner hypergraphs, defined by the property that for every two hyperedges the smallest of their two set differences is of size one. We characterize this class of Sperner hypergraphs by a decomposition theorem and derive several consequences from it. In particular, we obtain bounds on the size of $1$-Sperner hypergraphs and their transversal hypergraphs, show that the characteristic vectors of the hyperedges are linearly independent over the reals, and prove that $1$-Sperner hypergraphs are both threshold and equilizable. The study of $1$-Sperner hypergraphs is motivated also by their applications in graph theory, which we present in a companion paper.

The paper considers a linear model with grouped explanatory variables. If the model errors are not with zero mean and bounded variance or if model contains outliers, then the least squares framework is not appropriate. Thus, the quantile regression is an interesting alternative. In order to automatically select the relevant variable groups, we propose and study here the adaptive group LASSO quantile estimator. We establish the sparsity and asymptotic normality of the proposed estimator in two cases: fixed number and divergent number of variable groups. Numerical study by Monte Carlo simulations confirms the theoretical results and illustrates the performance of the proposed estimator.

Differential-algebraic equations (DAEs) are widely used for modeling of dynamical systems. In numerical analysis of DAEs, consistent initialization and index reduction are important preprocessing prior to numerical integration. Existing DAE solvers commonly adopt structural preprocessing methods based on combinatorial optimization. Unfortunately, the structural methods fail if the DAE has numerical or symbolic cancellations. For such DAEs, methods have been proposed to modify them to other DAEs to which the structural methods are applicable, based on the combinatorial relaxation technique. Existing modification methods, however, work only for a class of DAEs that are linear or close to linear. This paper presents two new modification methods for nonlinear DAEs: the substitution method and the augmentation method. Both methods are based on the combinatorial relaxation approach and are applicable to a large class of nonlinear DAEs. The substitution method symbolically solves equations for some derivatives based on the implicit function theorem and substitutes the solution back into the system. Instead of solving equations, the augmentation method modifies DAEs by appending new variables and equations. The augmentation method has advantages that the equation solving is not needed and the sparsity of DAEs is retained. It is shown in numerical experiments that both methods, especially the augmentation method, successfully modify high-index DAEs that the DAE solver in MATLAB cannot handle., Comment: A preliminary version of this paper is to appear in Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation (ISSAC 2019), Beijing, China, July 2019

Large deviations principles characterize the exponential decay rates of the probabilities of rare events. Cerrai and Rockner (2004) proved that systems of stochastic reaction–diffusion equations satisfy a large deviations principle that is uniform over bounded sets of initial data. This paper proves uniform large deviations results for a system of stochastic reaction–diffusion equations in a more general setting than Cerrai and Rockner. Furthermore, this paper identifies two common situations where the large deviations principle is uniform over unbounded sets of initial data, enabling the characterization of Freidlin–Wentzell exit time and exit shape asymptotics from unbounded sets.

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety coefficients less than 1 such that there is a covering of $B$ by translative homothets with these coefficients. $h_{\alpha}(B)$ is the minimal number of directions such that the boundary of $B$ can be illuminated by this number of directions except for a subset whose Hausdorff dimension is less than $\alpha$. In this paper, we prove that $g_{\alpha}(B)\leq h_{\alpha}(B)$, find upper and lower bounds for both numbers, and discuss several general conjectures. In particular, we show that $h_{\alpha} (B) > 2^{d-\alpha}$ for almost all $\alpha$ and $d$ when $B$ is the $d$-dimensional cube, thus disproving the conjecture from Research Problems in Discrete Geometry by Brass, Moser, and Pach.

Let $\Omega\subset\mathbb R^n$ be a $C^1$ domain, or more generally, a Lipschitz domain with small local Lipschitz constant. In this paper it is shown that if $u$ is a function harmonic in $\Omega$ and continuous in $\overline \Omega$ which vanishes in a relatively open subset $\Sigma\subset\partial\Omega$ and moreover the normal derivative $\partial_\nu u$ vanishes in a subset of $\Sigma$ with positive surface measure, then $u$ is identically $0$., Comment: More detailed explanation in some argument involving integration by parts and in Remark 3.3. An additional appendix with a self-contained proof of Lemma 4.3, whose proof was not included in the paper previously

This paper has two goals: to present some new results that are necessary for further study and applications of quasi-linear functionals, and, by combining known and new results, to serve as a convenient single source for anyone interested in quasi-linear functionals on locally compact non-compact spaces or on compact spaces. We study signed and positive quasi-linear functionals paying close attention to singly generated subalgebras. The paper gives representation theorems for quasi-linear functionals on $C_c(X)$ and for bounded quasi-linear functionals on $C_0(X)$ on a locally compact space, and for quasi-linear functionals on $C(X)$ on a compact space. There is an order-preserving bijection between quasi-linear functionals and compact-finite topological measures, which is also "isometric" when topological measures are finite. Finally, we further study properties of quasi-linear functionals and give an explicit example of a quasi-linear functional., Comment: 30 pages

The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the end of its second operation. The storage requirement of a job is determined by the processing time of its first operation. At any point in time, the total consumption of this additional resource cannot exceed a given limit (referred to as the storage capacity). The goal is to minimise the makespan, i.e. to minimise the time needed for the completion of all jobs. This problem is NP-hard in the strong sense. The paper analyses how the parameter - a lower bound on the storage capacity specified in terms of the processing times, affects the computational complexity.

In this paper we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation (DRR). In this paper, we approach the corresponding question for undirected Cayley graphs. The situation is complicated by the fact that there are two infinite families of groups that do not admit any graphical regular representation (GRR). The strategy for digraphs involved analysing separately the cases where the regular group $R$ has a nontrivial proper normal subgroup $N$ with the property that the automorphism group of the digraph fixes each $N$-coset setwise, and the cases where it does not. In this paper, we deal with undirected graphs in the case where the regular group has such a nontrivial proper normal subgroup., Comment: 27 pages

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they coalesce. We consider various entropic properties of these systems. We show that in systems with completely positive entropy, bi-infinite trajectories must carry entropy. In the case of directed walks in dimension 2 we show that positive entropy guarantees that all trajectories cannot be bi-infinite. To show that our theorems are proper, we construct a stationary discrete-time symmetric exclusion process whose particle trajectories form bi-infinite trajectories carrying entropy., Fixed some typos, included a reference to Hoffman's paper on discrete time totally asymmetric simple exclusion

In their recent paper [KNS2019], the first author, S. Kiriki, and T. Soma introduced a concept of pointwise emergence to measure the complexity of irregular orbits. They constructed a residual subset of the full shift with high pointwise emergence. In this paper we consider the set of points with high pointwise emergence for topologically mixing subshifts of finite type. We show that this set has full topological entropy, full Hausdorff dimension, and full topological pressure for any H\"older continuous potential. Furthermore, we show that this set belongs to a certain class of sets with large intersection property. This is a natural generalization of [FP2011] to pointwise emergence and Carath\'eodory dimension., Comment: Accepted for publication in Nonlinearity

In 1993, Shub and Smale posed the problem of finding a sequence of univariate polynomials of degree $N$ with condition number bounded above by $N$. In a previous paper by C. Belt\'an, U. Etayo, J. Marzo and J. Ortega-Cerd\`a, it was proved that the optimal value of the condition number is of the form $O(\sqrt{N})$, and the sequence demanded by Shub and Smale was described by a closed formula (for large enough $N\geqslant N_0$ with $N_0$ unknown) and by a search algorithm for the rest of the cases. In this paper we find concrete estimates for the constant hidden in the $O(\sqrt{N})$ term and we describe a simple formula for a sequence of polynomials whose condition number is at most $N$, valid for all $N=4M^2$, with $M$ a positive integer., Comment: 21 pages