Search

An approach to complex interpolation of compact subsets of $\Bbb C^n$, including Brunn-Minkowski type inequalities for the capacities of the interpolating sets, was developed recently by means of plurisubharmonic geodesics between relative extremal functions of the given sets. Here we show that a much better control can be achieved by means of the geodesics between weighted relative extremal functions. In particular, we establish convexity properties of the capacities that are stronger than those given by the Brunn-Minkowski inequalities., Final version; to appear in Arnold Math. J

In this paper, we turn our attention to the mathematical model to simulate steady, hydromagnetic, and radiating nanofluid flow past an exponentially stretching sheet. A numerical modeling technique, simplified finite difference method (SFDM), has been applied to the flow model that is based on partial differential equations (PDEs) which is converted to nonlinear ordinary differential equations (ODEs) by using similarity variables. For the resultant algebraic system, the SFDM uses the tridiagonal matrix algorithm (TDMA) in computing the solution. The effectiveness of numerical scheme is verified by comparing it with solution from the literature. However, where reference solution is not available, one can compare its numerical results with the results of MATLAB built-in package bvp4c. The velocity, temperature, and concentration profiles are graphed for a variety of parameters, i.e., Prandtl number, Grashof number, thermal radiation parameter, Darcy number, Eckert number, Lewis number, and Brownian and thermophoresis parameters. The significant effects of the associated emerging thermophysical parameters, i.e., skin friction coefficient, local Nusselt number, and local Sherwood numbers are analyzed and discussed in detail. Numerical results are compared from the available literature and found a close agreement with each other. It is found that the Eckert number upsurges the velocity curve. However, the dimensionless temperature declines with the Grashof number. It is also shown that the SFDM gives good results when compared with the results obtained from bvp4c and results from the literature.

Every set $\Lambda\subset R$ such that the sum of $\delta$-measures sitting at the points of $\Lambda$ is a Fourier quasicrystal, is the zero set of an exponential polynomial with imaginary frequencies., Comment: 8 pages

This paper expands further on a category theoretical formulation of Hochschild cohomology for monoid objects in monoidal categories enriched over abelian groups, which has been studied in arXiv:1605.00842. This topic was also presented at ISCRA, Isfahan, Iran, April 2019. The present paper aims to provide a more intuitive formulation of the Hochschild cochain complex and extend the definition to Hochschild cohomology with values in a bimodule object. In addition, an equivalent formulation of the Hochschild cochain complex in terms of a cosimplicial object in the category of abelian groups is provided., Comment: 12 pages

The so-called Whitham equation arises in the modeling of free surface water waves, and combines a generic nonlinear quadratic term with the exact linear dispersion relation for gravity waves on the free surface of a fluid with finite depth. In this work, the effect of incorporating capillarity into the Whitham equation is in focus. The capillary Whitham equation is a nonlocal equation similar to the usual Whitham equation, but containing an additional term with a coefficient depending on the Bond number which measures the relative strength of capillary and gravity effects on the wave motion. A spectral collocation scheme for computing approximations to periodic traveling waves for the capillary Whitham equation is put forward. Numerical approximations of periodic traveling waves are computed using a bifurcation approach, and a number of bifurcation curves are found. Our analysis uncovers a rich structure of bifurcation patterns, including subharmonic bifurcations, as well as connecting and crossing branches. Indeed, for some values of the Bond number, the bifurcation diagram features distinct branches of solutions which intersect at a secondary bifurcation point. The same branches may also cross without connecting, and some bifurcation curves feature self-crossings without self-connections. This is a submitted manuscript of an article published by Elsevier Ltd in Physica D: Nonlinear Phenomena, 6 December 2016.

Author's accepted version (post-print). This is a post-peer-review, pre-copyedit version of an article published in São Paulo Journal of Mathematical Sciences. The final authenticated version is available online at: http://dx.doi.org/10.1007/s40863-016-0046-4. This paper is a survey on some of the most basic results in the theory of quasi-hereditary algebras. In the last section we briefly discuss a recent development.

A generic strictly semistable bundle of degree zero over a curve \(X\) has a reducible theta divisor, given by the sum of the theta divisors of the stable summands of the associated graded bundle. The converse is not true: Beauville and Raynaud have each constructed stable bundles with reducible theta divisors. For \(X\) of genus \(g \ge 5\), we construct stable vector bundles over \(X\) of rank \(r\) for all \(r \ge 5\) with reducible and nonreduced theta divisors. We also adapt the construction to symplectic bundles. In the “Appendix”, Raynaud’s original example of a stable rank 2 vector bundle with reducible theta divisor over a bi-elliptic curve of genus 3 is generalized to bi-elliptic curves of genus \(g \ge 3\).

Let X be a standard determinantal scheme X \subset \PP^n of codimension c, i.e. a scheme defined by the maximal minors of a t \times (t+c-1) homogeneous polynomial matrix A. In this paper, we study the main features of its normal sheaf \shN_X. We prove that under some mild restrictions: (1) there exists a line bundle \shL on X \setminus Sing(X) such that \shN_X \otimes \shL is arithmetically Cohen-Macaulay and, even more, it is Ulrich whenever the entries of A are linear forms, (2) \shN_X is simple (hence, indecomposable) and, finally, (3) \shN_X is \mu-(semi)stable provided the entries of A are linear forms., Comment: This version makes a correction to Proposition 3.9 of previous versions on the arXiv, as well as to the published version in Crelle's journal, see Remark 3.18 for details

http://arxiv.org/abs/0809.3646; International audience; The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello (PODS'99, PODS'01) in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx in SODA'06, who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending tractability of many problems in database theory and artificial intelligence. Computing each of these width parameters is known to be an NP-hard problem. Moreover, the (generalized) hypertree width of an n-vertex hypergraph cannot be approximated within a logarithmic factor unless P=NP. In this paper, we study the approximability of (generalized, fractional) hyper treewidth of sparse hypergraphs where the criterion of sparsity reflects the sparsity of their incidence graphs. Our first step is to prove that the (generalized, fractional) hypertree width of a hypergraph is constant-factor sandwiched by the treewidth of its incidence graph, when the incidence graph belongs to some apex-minor-free graph class (the family of apex-minor-free graph classes includes planar graphs and graphs of bounded genus). This determines the combinatorial borderline above which the notion of (generalized, fractional) hypertree width becomes essentially more general than treewidth, justifying that way its functionality as a hypergraph acyclicity measure. While for more general sparse families of hypergraphs treewidth of incidence graphs and all hypertree width parameters may differ arbitrarily, there are sparse families where a constant factor approximation algorithm is possible. In particular, we give a constant factor approximation polynomial time algorithm for (generalized, fractional) hypertree width on hypergraphs whose incidence graphs belong to some H-minor-free graph class. This extends the results of Feige, Hajiaghayi, and Lee from STOC'05 on approximating treewidth of H-minor-free graphs.

The k -Leaf Out-Branching problem is to find an out-branching, that is a rooted oriented spanning tree, with at least k leaves in a given digraph. The problem has recently received much attention from the viewpoint of parameterized algorithms. Here, we take a kernelization based approach to the k -Leaf-Out-Branching problem. We give the first polynomial kernel for Rooted k -Leaf-Out-Branching, a variant of k -Leaf-Out-Branching where the root of the tree searched for is also a part of the input. Our kernel with O ( k 3 ) vertices is obtained using extremal combinatorics. For the k -Leaf-Out-Branching problem, we show that no polynomial-sized kernel is possible unless coNP is in NP/poly . However, our positive results for Rooted k -Leaf-Out-Branching immediately imply that the seemingly intractable k -Leaf-Out-Branching problem admits a data reduction to n independent polynomial-sized kernels. These two results, tractability and intractability side by side, are the first ones separating Karp kernelization from Turing kernelization . This answers affirmatively an open problem regarding “cheat kernelization” raised by Mike Fellows and Jiong Guo independently.