Search

Even fairly good students, when they have obtained the solution of the problem and written down neatly the argument, shut their books and look for something else. Doing so, they miss an important a...

The variability and interdependence of local porosity and local mean geodesic tortuosity, which is a measure for the sinuosity of shortest transportation paths, is investigated at the example of the microstructure in sack paper. By means of statistical image analysis, these two morphological characteristics are computed for several cutouts of 3D image data obtained by X-ray microcomputed tomography. Considering cutouts of different sizes allows us to study the influence of the sample size on the local variability of the considered characteristics. Moreover, the interdependence between local porosity and local mean geodesic tortuosity is quantified by modeling their joint distribution parametrically using Archimedean copulas. It turns out that the family of Gumbel copulas is an appropriate model type, which is formally validated by a goodness of fit test. Besides mean geodesic tortuosity, we consider further related morphological characteristics, describing the sinuosity of those shortest transportation paths, whose minimum diameter exceeds a predefined threshold. Moreover, we show that the copula approach investigated in this paper can also be used to quantify the negative correlation between local porosity and these modified versions of local mean geodesic tortuosity. Our results elucidate the impact of local porosity on various kinds of morphological characteristics, which are not experimentally accessible and which are important for local air permeance – a key property of sack paper.

Very recently Bordelles, Dai, Heyman, Pan and Shparlinski studied asymptotic behaviour of the quantity $$\begin{aligned} S_f(x) := \sum _{n\leqslant x} f\left( \left[ \frac{x}{n}\right] \right) , \end{aligned}$$and established some asymptotic formulas for $$S_f(x)$$ under three different types of assumptions on f. In this short note we improve some of their results.

The paper alluded to in the title contains the following striking result: Let $I$ be the unit interval and $\Delta$ the Cantor set. If $X$ is a quasi Banach space containing no copy of $c_0$ which is isomorphic to a closed subspace of a space with a basis and $C(I, X)$ is linearly homeomorphic to $C(\Delta, X)$, then $X$ is locally convex, i.e., a Banach space. It is shown that Kalton result is sharp by exhibiting non locally convex quasi Banach spaces X with a basis for which $C(I, X)$ and $C(\Delta, X)$ are isomorphic. Our examples are rather specific and actually in all cases X is isomorphic to $C(\Delta, X)$ if $K$ is a metric compactum of finite covering dimension., Comment: 4 pages

P values linked to null hypothesis significance testing (NHST) is the most widely (mis)used method of statistical inference. Empirical data suggest that across the biomedical literature (1990–2015)...

Propositions 1.1–1.3 stated below contribute to results and certain problems considered in [E-S], on the behavior of products $$\Pi^n_1(1-z^{a_j}),1\leq{a_1}...\leq{a_n}$$ integers. In the discussion below, {a1,..., an} will be either a proportional subset of {1,..., n} or a set of large arithmetic diameter.

In this short note, we show that Theorem 4.3 of Liu and Yu (Monatshefte Math 195:173–176, 2021) is a consequence of Lemma 2 of Ballester-Bolinches and Esteban-Romero (J Aust Math Soc 75:181–191, 2003).

We congratulate the authors Bertsimas, Pauphilet and van Parys (hereafter BPvP) and Hastie, Tibshirani and Tibshirani (hereafter HTT) for providing fresh and insightful views on the problem of variable selection and prediction in linear models. Their contributions at the fundamental level provide guidance for more complex models and procedures.

International audience; This survey was written by students of L. D. Faddeev under the editorship of L. A. Takhtajan. Sections 1.1, 1.2, 2–4, and 6 were written by Takhtajan, §§1.3 and 1.4 by F. A. Smirnov, §§5.1 and 5.2 by E. K. Sklyanin, §§5.3–5.6 by Sklyanin, Smirnov, and Takhtajan, §7.1 by M. A. Semenov- Tian-Shansky, §§7.2–7.6 by Takhtajan and S. L. Shatashvili, §7.7 by A. Yu. Alekseev and Shatashvili, and §8 by I. Ya. Aref'eva.

The translation into English of Aleksandr Yakovlevich Khinchin's (1894–1959) 1926 paper entitled ‘Ideas of intuitionism and the struggle for a subject matter in contemporary mathematics’ is made available for the first time. Here, Khinchin presented the famous foundational debate between L.E.J. Brouwer and David Hilbert of the 1920s in terms of a search for a mathematics with content. His main aim seems to have been to make intuitionism ideologically acceptable to his audience at the Communist Academy by means of the claim that insofar as Brouwer's intuitionism had a clear ‘subject matter’ and Hilbert's new program was a concession to intuitionism, the alleged victory of intuitionism not only implied the defeat of ‘empty’ formalism, but also showed the compatibility and affinity of Marxism with the newest developments in modern mathematics. This introduction provides a tentative exploration of the issue of what was tactical (or due to ideological pressure) and what was real scientific interest (or due to ignorance) (or what was both) in Khinchin's 1926 paper in the form of a detailed commentary, especially, on the tactical side of his presentation of the positions of Brouwer and Hilbert.

In 1903, Epstein published his proof of meromorphic continuation and a functional equation for Dirichlet series associated with quadratic forms, now called Epstein zeta-functions. However, already in 1889 (or even earlier) Hurwitz was aware of these results as his mathematical diaries and some unpublished notes (in an almost final form) found in his estate at the ETH Zurich show. In this article we present and analyze Hurwitz's notes and compare his reasoning with Epstein's paper in detail.

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

We correct an error in the paper of Z. Shen, S. Li, and J. Zhang published in [4]. In addition, we give an answer to a question posed by the authors.

Let a(n) be the Fourier coefficient of a holomorphic cusp form on some discrete subgroup of \(SL_2({\mathbb R})\). This note is to refine a recent result of Hofmann and Kohnen on the non-positive (resp. non-negative) product of \(a(n)a(n+r)\) for a fixed positive integer r.

For any discrete valuation ring R, any R-linear mapping u from an R-module E into an R-module F and any \(y_0\in F\), a necessary and sufficient condition for the solvability of the equation \(u(x)=y_0\) is established, and an application of this result is presented.

Let [Formula: see text] be a projective variety of dimension [Formula: see text] over an algebraically closed field of arbitrary characteristic. We prove a Fujiki–Lieberman type theorem on the structure of the automorphism group of [Formula: see text]. Let [Formula: see text] be a group of zero entropy automorphisms of [Formula: see text] and [Formula: see text] the set of elements in [Formula: see text] which are isotopic to the identity. We show that after replacing [Formula: see text] by a suitable finite-index subgroup, [Formula: see text] is a unipotent group of the derived length at most [Formula: see text]. This result was first proved by Dinh et al. for compact Kähler manifolds.

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

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

In this paper, we discuss the validity of the result of Khuangsatung and Kangtunyakarn [Existence and convergence theorem for fixed point problem of various nonlinear mappings and variational inequality problems without some assumptions, Filomat 32(1) (2018) 305–309].

We characterize functions of finite energy in the plane in terms of their traces on the lines that make up "graph paper" with squares of side length $mn$ for all $n$, and certain $\12-$order Sobolev norms on the graph paper lines. We also obtain analogous results for functions of finite energy on two classical fractals: the Sierpinski gasket and the Sierpinski carpet.

In this note we re-examine the analysis of the paper "On the martingale property of stochastic exponentials" by B. Wong and C.C. Heyde, Journal of Applied Probability, 41(3):654-664, 2004. Some counterexamples are presented and alternative formulations are discussed., Comment: To appear in Journal of Applied Probability, 11 pages

The abstract results and applications presented in “Controllability of fractional neutral stochastic functional differential systems, Z. Angew. Math. Phys. 65 (2014), no. 5, 941–959, are not correct. Moreover, the class of differential control problems studied in [1] is not H-controllable.

The preeminent target of present study is to reveal the speed characteristic of ongoing outbreak COVID-19 due to novel coronavirus. On January 2020, the novel coronavirus infection (COVID-19) detected in India, and the total statistic of cases continuously increased to 7 128 268 cases including 109 285 deceases to October 2020, where 860 601 cases are active in India. In this study, we use the Hermite wavelets basis in order to solve the COVID-19 model with time- arbitrary Caputo derivative. The discussed framework is based upon Hermite wavelets. The operational matrix incorporated with the collocation scheme is used in order to transform arbitrary-order problem into algebraic equations. The corrector scheme is also used for solving the COVID-19 model for distinct value of arbitrary order. Also, authors have investigated the various behaviors of the arbitrary-order COVID-19 system and procured developments are matched with exiting developments by various techniques. The various illustrations of susceptible, exposed, infected, and recovered individuals are given for its behaviors at the various value of fractional order. In addition, the proposed model has been also supported by some numerical simulations and wavelet-based results.

Månsson and Shukur (Econ Model 28:1475–1481, 2011) proposed a Poisson ridge regression estimator (PRRE) to reduce the negative effects of multicollinearity. However, a weakness of the PRRE is its relatively large bias. Therefore, as a remedy, Türkan and Özel (J Appl Stat 43:1892–1905, 2016) examined the performance of almost unbiased ridge estimators for the Poisson regression model. These estimators will not only reduce the consequences of multicollinearity but also decrease the bias of PRRE and thus perform more efficiently. The aim of this paper is twofold. Firstly, to derive the mean square error properties of the Modified Almost Unbiased PRRE (MAUPRRE) and Almost Unbiased PRRE (AUPRRE) and then propose new ridge estimators for MAUPRRE and AUPRRE. Secondly, to compare the performance of the MAUPRRE with the AUPRRE, PRRE and maximum likelihood estimator. Using both simulation study and real-world dataset from the Swedish football league, it is evidenced that one of the proposed, MAUPRRE ($$ \hat{k}_{q4} $$ k ^ q 4 ) performed better than the rest in the presence of high to strong (0.80–0.99) multicollinearity situation.

Funder: John Simon Guggenheim Memorial Foundation; doi: https://doi.org/10.13039/100005851, Funder: Einstein Visiting Fellow Program, The Rayleigh–Bénard system with stress-free boundary conditions is shown to have a global attractor in each affine space where velocity has fixed spatial average. The physical problem is shown to be equivalent to one with periodic boundary conditions and certain symmetries. This enables a Gronwall estimate on enstrophy. That estimate is then used to bound the L 2 norm of the temperature gradient on the global attractor, which, in turn, is used to find a bounding region for the attractor in the enstrophy–palinstrophy plane. All final bounds are algebraic in the viscosity and thermal diffusivity, a significant improvement over previously established estimates. The sharpness of the bounds are tested with numerical simulations.

Congruences mod p for a prime p and partial products of the numbers 1,…, p − 1 are obtained. Bibliography: 2 titles.

The main goal of this short paper is to prove the existence of rank 2 simple and special Ulrich bundles on a wide class of elliptic surfaces: namely, on regular Weierstrass fibrations \(\pi : S\rightarrow \mathbb {P}^1\). Alongside we also show the existence of rank 2 weakly Ulrich sheaves on arbitrary Weierstrass fibrations \(S\rightarrow C_0\) and we deal with the (non-)existence of rank one Ulrich bundles on them.

© 2019, Pleiades Publishing, Ltd. It is well known that the classical and Sobolev wave fronts were extended to nonequivalent global versions by the use of the short-time Fourier transform. In this very short paper, we give complete characterizations of the former wave front sets in terms of the short-time Fourier transform.

The first symptomatic infected individuals of coronavirus (Covid-19) was confirmed in December 2020 in the city of Wuhan, China. In India, the first reported case of Covid-19 was confirmed on 30 January 2020. Today, coronavirus has been spread out all over the world. In this manuscript, we studied the coronavirus epidemic model with a true data of India by using Predictor-Corrector scheme. For the proposed model of Covid-19, the numerical and graphical simulations are performed in a framework of the new generalised Caputo sense non-integer order derivative. We analysed the existence and uniqueness of solution of the given fractional model by the definition of Chebyshev norm, Banach space, Schauder's second fixed point theorem, Arzel's-Ascoli theorem, uniform boundedness, equicontinuity and Weissinger's fixed point theorem. A new analysis of the given model with the true data is given to analyse the dynamics of the model in fractional sense. Graphical simulations show the structure of the given classes of the non-linear model with respect to the time variable. We investigated that the mentioned method is copiously strong and smooth to implement on the systems of non-linear fractional differential equation systems. The stability results for the projected algorithm is also performed with the applications of some important lemmas. The present study gives the applicability of this new generalised version of Caputo type non-integer operator in mathematical epidemiology. We compared that the fractional order results are more credible to the integer order results.

In this short paper, we consider the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of two squares of primes and a k-th power of prime for any integer $$k \ge 3$$ . Our results improve the recent results due to Brudern (in: Sander, Steuding, Steuding (eds) From arithmetic to zeta-functions, Springer, Cham 2016). The similar method can be also applied to some related questions in this direction, and this can improve the previous results.

We propose a complete-search algorithm for solving a class of non-convex, possibly infinite-dimensional, optimization problems to global optimality. We assume that the optimization variables are in a bounded subset of a Hilbert space, and we determine worst-case run-time bounds for the algorithm under certain regularity conditions of the cost functional and the constraint set. Because these run-time bounds are independent of the number of optimization variables and, in particular, are valid for optimization problems with infinitely many optimization variables, we prove that the algorithm converges to an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}ε-suboptimal global solution within finite run-time for any given termination tolerance \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}ε>0. Finally, we illustrate these results for a problem of calculus of variations.

In this short paper, we will show that the space of real valued uniformly continuous functions defined on a metric space (X,d) is a ring if and only if every subset A ? X has one of the following properties: ? A is Bourbaki-bounded, i.e., every uniformly continuous function on X is bounded on A. ? A contains an infinite uniformly isolated subset, i.e., there exist ? > 0 and an infinite subset F ? A such that d(a,x) ? ? for every a ? F, x ? X n \{a}.

We show that bounded self-contracted curves are rectifiable in metric spaces with weak lower curvature bound in a sense we introduce in this article. This class of spaces is wide and includes, for example, finite-dimensional Alexandrov spaces of curvature bounded below and Berwald spaces of nonnegative flag curvature. (To be more precise, our condition is regarded as a strengthened doubling condition and holds also for a certain class of metric spaces with upper curvature bound.) We also provide the non-embeddability of large snowflakes into (balls in) metric spaces in the same class. We follow the strategy of the last author's previous paper based on the small rough angle condition, where spaces with upper curvature bound are considered. The results in this article show that such a strategy applies to spaces with lower curvature bound as well., Comment: A goofy mistake in formulations of Theorem 2 and 4 is fixed

This short paper is motivated by the paper of Bu et al. [C. Bu, C. Feng, P. Dong, A note on computational formulas for the Drazin inverse of certain block matrices, J. Appl. Math. Comput.(38) (2012) 631-640], where the authors gave additive formula for Drazin inverse for matrices under new conditions, and two representations under some specific conditions. Here is shown that the additive formula is not valid for all matrices which satisfy given conditions. Also, here is proved that the representations which were given in mentioned paper do not extend the results given by Hartwig et al. [R. Hartwig, X. Li, Y. Wei, Representations for the Drazin inverse of a 2 _ 2 block matrix, SIAM J. Matrix. Anal. Appl. (27)(2006) 757-771 ], in fact they are equivalent.

In this short paper we study the d-Hermite condition about stably free modules for skew $$\textit{PBW}$$ extensions. For this purpose, we estimate the stable rank of these non-commutative rings. In addition, and closely related with these questions, we will prove Kronecker’s theorem about the radical of finitely generated ideals for some particular types of skew $$\textit{PBW}$$ extensions.

Let I be the Stanley–Reisner ideal of a simplicial complex Δ. In this short paper, we shall give a formula of vanishing of the local cohomology modules for S/I(r) in the case Δ is a union of disjoint matroids, where I(r) is the rth symbolic power of I. As an application, we will improve a previous result in Minh and Nakamura (Nagoya Math. J. 213, 127–140, 2014) for the k-Buchsbaumness of S/I(r).

Recently, Saleh claimed to have solved `a long standing open question' in Topology; namely, he proved that every almost continuous function is closure continuous (= $\theta$-continuous). Unfortunately, this problem was settled long time ago and even a better result is known., Comment: 2 pages, to appear in "Glasgow Math. J."

We study the classical \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {NP}}$$\end{document}NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph. The approximability of MaxEDP/MaxNDP is currently not well understood; the best known lower bound is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${2^{\varOmega (\sqrt{\log n})}}$$\end{document}2Ω(logn), assuming \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {NP}\not \subseteq \mathsf {DTIME}(n^{\mathcal {O}(\log n)})}$$\end{document}NP⊈DTIME(nO(logn)). This constitutes a significant gap to the best known approximation upper bound of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}(\sqrt{n})}$$\end{document}O(n) due to Chekuri et al. (Theory Comput 2:137–146, 2006), and closing this gap is currently one of the big open problems in approximation algorithms. In their seminal paper, Raghavan and Thompson (Combinatorica 7(4):365–374, 1987) introduce the technique of randomized rounding for LPs; their technique gives an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}(1)}$$\end{document}O(1)-approximation when edges (or nodes) may be used by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}\left( \log n/\log \log n\right) }$$\end{document}Ologn/loglogn paths. In this paper, we strengthen the fundamental results above. We provide new bounds formulated in terms of the feedback vertex set number r of a graph, which measures its vertex deletion distance to a forest. In particular, we obtain the following results:For MaxEDP, we give an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}(\sqrt{r} \log ({k}r))}$$\end{document}O(rlog(kr))-approximation algorithm. Up to a logarithmic factor, our result strengthens the best known ratio \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}(\sqrt{n})}$$\end{document}O(n) due to Chekuri et al., as \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${r\le n}$$\end{document}r≤n.Further, we show how to route \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varOmega ({\text {OPT}}^{*})}$$\end{document}Ω(OPT∗) pairs with congestion bounded by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {O}(\log (kr)/\log \log (kr))}$$\end{document}O(log(kr)/loglog(kr)), strengthening the bound obtained by the classic approach of Raghavan and Thompson.For MaxNDP, we give an algorithm that gives the optimal answer in time \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(k+r)^{\mathcal {O}(r)}\cdot n}$$\end{document}(k+r)O(r)·n. This is a substantial improvement on the run time of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${2^kr^{\mathcal {O}(r)}\cdot n}$$\end{document}2krO(r)·n, which can be obtained via an algorithm by Scheffler. We complement these positive results by proving that MaxEDP is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {NP}}$$\end{document}NP-hard even for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${r=1}$$\end{document}r=1, and MaxNDP is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {W}[1]}$$\end{document}W[1]-hard when r is the parameter. This shows that neither problem is fixed-parameter tractable in r unless \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf {FPT}= \mathsf {W}[1]}$$\end{document}FPT=W[1] and that our approximability results are relevant even for very small constant values of r.

0.1. How it all began. When the second author translated a result on algebraic sur faces into the language of lattice polygons using toric geometry, he got a simple inequality for lattice polygons. This inequality had originally been discovered by Scott [12]. The first author then found a third proof. Subsequently, both authors went through a phase of polygon addiction. Once you get started drawing lattice polygons on graph paper and discovering relations between their numerical invariants, it is not so easy to stop! (The gentle reader has been warned.) Thus, it was just unavoidable that the authors came up with new inequalities: Scott's inequality can be sharpened if one takes into account another invariant, which is de fined by peeling off the skins of the polygons like an onion (see Section 3).

It is pointed out that the proof of the basic result of Rahmanov's paper has a serious gap. It is documented by original sources that a statement he relied on in the proof contains a misprint, and it is shown by a counterexample that this statement (with the misprint) is, in fact, false. A somewhat weaker statement is proved true.

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

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is strictly connected with the problems of solving equations (or systems of equations) over finite algebras. The research reported in this work was motivated by a desire to know for which finite algebras $\mathbf A$ there is a polynomial time algorithm that decides if an equation over $\mathbf A$ has a solution. We are also looking for polynomial time algorithms that decide if two circuits over a finite algebra compute the same function. Although we have not managed to solve these problems in the most general setting we have obtained such a characterization for a very broad class of algebras from congruence modular varieties. This class includes most known and well-studied algebras such as groups, rings, modules (and their generalizations like quasigroups, loops, near-rings, nonassociative rings, Lie algebras), lattices (and their extensions like Boolean algebras, Heyting algebras or other algebras connected with multi-valued logics including MV-algebras). This paper seems to be the first systematic study of the computational complexity of satisfiability of non-Boolean circuits and solving equations over finite algebras. The characterization results provided by the paper is given in terms of nice structural properties of algebras for which the problems are solvable in polynomial time., 50 pages

In a previous paper, we obtained several "compact versions" of Rubio de Francia's weighted extrapolation theorem, which allowed us to extrapolate the compactness of linear operators from just one space to the full range of weighted Lebesgue spaces, where these operators are bounded. In this paper, we study the extrapolation of compactness for bilinear operators in terms of bilinear Muckenhoupt weights. As applications, we easily recover and improve earlier results on the weighted compactness of commutators of bilinear Calder\'{o}n-Zygmund operators, bilinear fractional integrals and bilinear Fourier multipliers. More general versions of these results are recently due to Cao, Olivo and Yabuta (arXiv:2011.13191), whose approach depends on developing weighted versions of the Fr\'echet--Kolmogorov criterion of compactness, whereas we avoid this by relying on "softer" tools, which might have an independent interest in view of further extensions of the method., Comment: v3: final version, incorporated referee comments, to appear in Indagationes Mathematicae, 27 pages