The Reich–Zaslavski property and fixed points of non-self multivalued mappings

Let (X, d) be a metric space, Y be a nonempty subset of X, and let \(T:Y \rightarrow P(X)\) be a non-self multivalued mapping. In this paper, by a new technique we study the fixed point theory of multivalued mappings under the assumption of the existence of a bounded sequence \((x_n)_n\) in Y such that \(T^nx_n\subseteq Y,\) for each \(n \in \mathbb {N}\). Our main result generalizes fixed point theorems due to Matkowski (Diss. Math. 127, 1975), W?grzyk (Diss. Math. (Rozprawy Mat.) 201, 1982), Reich and Zaslavski (Fixed Point Theory 8:303–307, 2007), Petru?el et al. (Set-Valued Var. Anal. 23:223–237, 2015) and provides a solution to the problems posed in Petru?el et al. (Set-Valued Var. Anal. 23:223–237, 2015) and Rus and ?erban (Miskolc Math. Notes 17:1021–1031, 2016).     

Fourier transforms and bent functions on faithful actions of finite abelian groups

Let G be a finite abelian group acting faithfully on a finite set X. The G-bentness and G-perfect nonlinearity of functions on X are studied by Poinsot and co-authors (Discret Appl Math 157:1848–1857, 2009; GESTS Int Trans Comput Sci Eng 12:1–14, 2005) via Fourier transforms of functions on G. In this paper we introduce the so-called \(G\)-dual set \(\widehat{X}\) of X, which plays the role similar to the dual group \(\widehat{G}\) of G, and develop a Fourier analysis on X, a generalization of the Fourier analysis on the group G. Then we characterize the bentness and perfect nonlinearity of functions on X by their own Fourier transforms on \(\widehat{X}\). Furthermore, we prove that the bentness of a function on X can be determined by its distance from the set of G-linear functions. As direct consequences, many known results in Logachev et al. (Discret Math Appl 7:547–564, 1997), Carlet and Ding (J Complex 20:205–244, 2004), Poinsot (2009), Poinsot et al. (2005) and some new results about bent functions on G are obtained. In order to explain the theory developed in this paper clearly, examples are also presented.     

Derivatives for smooth representations of <Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, ℝ) and <Emphasis Type="Italic">GL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, ℂ)

The notion of derivatives for smooth representations of GL(n, ? _p ) was defined in [BZ77]. In the archimedean case, an analog of the highest derivative was defined for irreducible unitary representations in [Sah89] and called the “adduced” representation. In this paper we define derivatives of all orders for smooth admissible Fréchet representations of moderate growth. The real case is more problematic than the p-adic case; for example, arbitrary derivatives need not be admissible. However, the highest derivative continues being admissible, and for irreducible unitarizable representations coincides with the space of smooth vectors of the adduced representation.In the companion paper [AGS] we prove exactness of the highest derivative functor, and compute highest derivatives of all monomial representations.We apply those results to finish the computation of adduced representations for all irreducible unitary representations and to prove uniqueness of degenerate Whittaker models for unitary representations, thus completing the results of [Sah89, Sah90, SaSt90, GS13a].     

O $$\varvec{}$$-orm preservers ad the Aleksadrov coservative $$\varvec{}$$-distace problem

The goal of this paper is to point out that the results obtained in the recent papers (Chen and Song in Nonlinear Anal 72:1895–1901, 2010; Chu in J Math Anal Appl 327:1041–1045, 2007; Chu et al. in Nonlinear Anal 59:1001–1011, 2004a, J. Math Anal Appl 289:666–672, 2004b) can be seriously strengthened in the sense that we can significantly relax the assumptions of the main results so that we still get the same conclusions. In order to do this first, we prove that for \(n \ge 3\) any transformation which preserves the n-norm of any n vectors is automatically plus-minus linear. This will give a re-proof of the well-known Mazur–Ulam-type result that every n-isometry is automatically affine (\(n \ge 2\)) which was proven in several papers, e.g. in Chu et al. (Nonlinear Anal 70:1068–1074, 2009). Second, following the work of Rassias and ?emrl (Proc Am Math Soc 118:919–925, 1993), we provide the solution of a natural Aleksandrov-type problem in n-normed spaces, namely, we show that every surjective transformation which preserves the unit n-distance in both directions (\(n\ge 2\)) is automatically an n-isometry.     

Symmetry axioms and perceived ambiguity

Since at least de Finetti (Annales de l’Institut Henri Poincare 7:1–68, 1937), preference symmetry assumptions have played an important role in models of decision making under uncertainty. In the current paper, we explore (1) the relationship between the symmetry assumption of Klibanoff et al. (KMS) (Econometrica 82:1945–1978, 2014) and alternative symmetry assumptions in the literature, and (2) assuming symmetry, the relationship between the set of relevant measures, shown by KMS (2014) to reflect only perceived ambiguity, and the set of measures (which we will refer to as the Bewley set) developed by Ghirardato et al. (J Econ Theory 118:133–173, 2004), Nehring (Ambiguity in the context of probabilistic beliefs, working paper, 2001, Bernoulli without Bayes: a theory of utility-sophisticated preference, working paper, 2007) and Ghirardato and Siniscalchi (A more robust definition of multiple priors, working paper, 2007, Econometrica 80:2827–2847, 2012). This Bewley set is the main alternative offered in the literature as possibly representing perceived ambiguity. Regarding symmetry assumptions, we show that, under relatively mild conditions, a variety of preference symmetry conditions from the literature [including that in KMS (2014)] are equivalent. In KMS (2014), we showed that, under symmetry, the Bewley set and the set of relevant measures are not always the same. Here, we establish a preference condition, No Half Measures, that is necessary and sufficient for the two to be the same under symmetry. This condition is rather stringent. Only when it is satisfied may the Bewley set be interpreted as reflecting only perceived ambiguity and not also taste aspects such as ambiguity aversion.     

A brief note on the coarea formula

In this note we consider a special case of the famous Coarea Formula whose initial proof (for functions from any Riemannian manifold of dimension 2 into \({\mathbb {R}}\)) is due to Kronrod (Uspechi Matem Nauk 5(1):24–134, 1950) and whose general proof (for Lipschitz maps between two Riemannian manifolds of dimensions n and p) is due to Federer (Am Math Soc 93:418–491, 1959). See also Maly et al. (Trans Am Math Soc 355(2):477–492, 2002), Fleming and Rishel (Arch Math 11(1):218–222, 1960) and references therein for further generalizations to Sobolev mappings and BV functions respectively. We propose two counterexamples which prove that the coarea formula that we can find in many references (for example Bérard (Spectral geometry: direct and inverse problems, Springer, 1987), Berger et al. (Le Spectre d’une Variété Riemannienne, Springer, 1971) and Gallot (Astérisque 163(164):31–91, 1988), is not valid when applied to \(C^\infty \) functions. The gap appears only for the non generic set of non Morse functions.     

Every 3-connected $$\{K_{1,3},N_{1,2,3}\}$$-free graph is Hamilton-connected

A graph G is \(\{X,Y\}\)-free if it contains neither X nor Y as an induced subgraph. Pairs of connected graphs X, Y such that every 3-connected \(\{X,Y\}\)-free graph is Hamilton-connected have been investigated recently in (2002, 2000, 2012). In this paper, it is shown that every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected, where \(N_{1,2,3}\) is the graph obtained by identifying end vertices of three disjoint paths of lengths 1, 2, 3 to the vertices of a triangle.     

On the maximum TSP with <Emphasis Type="Italic">γ</Emphasis>-parameterized triangle inequality

The maximum TSP with γ-parameterized triangle inequality is defined as follows. Given a complete graph G = (V, E, w) in which the edge weights satisfy w(uv) ≤ γ · (w(ux) + w(xv)) for all distinct nodes \({u,x,v \in V}\), find a tour with maximum weight that visits each node exactly once. Recently, Zhang et al. (Theor Comput Sci 411(26–28):2537–2541, 2010) proposed a \({\frac{\gamma+1}{3\gamma}}\)-approximation algorithm for \({\gamma\in\left[\frac{1}{2},1\right)}\). In this paper, we show that the approximation ratio of Kostochka and Serdyukov’s algorithm (Upravlyaemye Sistemy 26:55–59, 1985) is \({\frac{4\gamma+1}{6\gamma}}\), and the expected approximation ratio of Hassin and Rubinstein’s randomized algorithm (Inf Process Lett 81(5):247–251, 2002) is \({\frac{3\gamma+\frac{1}{2}}{4\gamma}-O\left(\frac{1}{\sqrt{n}}\right)}\), for \({\gamma\in\left[\frac{1}{2},+\infty\right)}\). These improve the result in Zhang et al. (Theor Comput Sci 411(26–28):2537–2541, 2010) and generalize the results in Hassin and Rubinstein and Kostochka and Serdyukov (Inf Process Lett 81(5):247–251, 2002; Upravlyaemye Sistemy 26:55–59, 1985).     

Congruences of two-variable <Emphasis Type="Italic">p</Emphasis>-adic <Emphasis Type="Italic">L</Emphasis>-functions of congruent modular forms of different weights

Vatsal (Duke Math J 98(2):397–419, 1999) proved that there are congruences between the p-adic L-functions (constructed by Mazur and Swinnerton-Dyer in Invent Math 25:1–61, 1974) of congruent modular forms of the same weight under some conditions. On the other hand, Kim (J Number Theory 144: 188–218, 2014), the second author, constructed two-variable p-adic L-functions of modular forms attached to imaginary quadratic fields generalizing Hida’s work (Invent Math 79:159–195, 1985), and the novelty of his construction was that it works whether p is an ordinary prime or not. In this paper, we prove congruences between the two-variable p-adic L-functions (of the second author) of congruent modular forms of different but congruent weights under some conditions when p is a nonordinary prime for the modular forms. This result generalizes the work of Emerton et al. (Invent Math 163(3): 523–580, 2006), who proved similar congruences between the p-adic L-functions of congruent modular forms of congruent weights when p is an ordinary prime.     

Robust return risk measures

In this paper we provide an axiomatic foundation to Orlicz risk measures in terms of properties of their acceptance sets, by exploiting their natural correspondence with shortfall risk Föllmer and Schied (Stochastic finance. De Gruyter, Berlin, 2011), thus paralleling the characterization in Weber (Math Financ 16:419–442, 2006). From a financial point of view, Orlicz risk measures assess the stochastic nature of returns, in contrast to the common use of risk measures to assess the stochastic nature of a position’s monetary value. The correspondence with shortfall risk leads to several robustified versions of Orlicz risk measures, and of their optimized translation invariant extensions (Rockafellar and Uryasev in J Risk 2:21–42, 2000, Goovaerts et al. in Insur Math Econ 34:505–516, 2004), arising from an ambiguity averse approach as in Gilboa and Schmeidler (J Math Econ 18:141–153, 1989), Maccheroni et al. (Econometrica 74:1447–1498, 2006), Chateauneuf and Faro (J Math Econ 45:535–558, 2010), or from a multiplicity of Young functions. We study the properties of these robust Orlicz risk measures, derive their dual representations, and provide some examples and applications.     

Construction of cyclotomic codebooks nearly meeting the Welch bound

Ding and Feng (IEEE Trans Inform Theory 52(9):4229–4235, 2006, IEEE Trans Inform Theory 53(11):4245–4250, 2007) constructed series of (N, K) codebooks which meet or nearly meet the Welch bound \({\sqrt{\frac{N-K}{(N-1)K}}}\) by using difference set (DS) or almost difference set (ADS) in certain finite abelian group respectively. In this paper, we generalize the cyclotomic constructions considered in (IEEE Trans Inform Theory 52(9):4229–4235, 2006, IEEE Trans Inform Theory 53(11):4245–4250, 2007) and (IEEE Trans Inform Theory 52(5), 2052–2061, 2006) to present more series of codebooks which nearly meet the Welch bound under looser conditions than ones required by DS and ADS.     

Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems

We study the min-cost chain-constrained spanning-tree (MCCST) problem: find a min-cost spanning tree in a graph subject to degree constraints on a nested family of node sets. We devise the first polytime algorithm that finds a spanning tree that (i) violates the degree constraints by at most a constant factor and (ii) whose cost is within a constant factor of the optimum. Previously, only an algorithm for unweighted CCST was known (Olver and Zenklusen in Proceedings of the 16th IPCO, pp 324–335, 2013), which satisfied (i) but did not yield any cost bounds. This also yields the first result that obtains an O(1)-factor for both the cost approximation and violation of degree constraints for any spanning-tree problem with general degree bounds on node sets, where an edge participates in a super-constant number of degree constraints. A notable feature of our algorithm is that we reduce MCCST to unweighted CCST (and then utilize Olver and Zenklusen in Proceedings of the 16th IPCO, pp 324–335, 2013) via a novel application of Lagrangian duality to simplify the cost structure of the underlying problem and obtain a decomposition into certain uniform-cost subproblems. We show that this Lagrangian-relaxation based idea is in fact applicable more generally and, for any cost-minimization problem with packing side-constraints, yields a reduction from the weighted to the unweighted problem. We believe that this reduction is of independent interest. As another application of our technique, we consider the k -budgeted matroid basis problem, where we build upon a recent rounding algorithm of Bansal and Nagarajan (Proceedings of IPCO 2016. arXiv:1512.02254, 2015) to obtain an improved \(n^{O(k^{1.5}/\epsilon )}\)-time algorithm that returns a solution that satisfies (any) one of the budget constraints exactly and incurs a \((1+\epsilon )\)-violation of the other budget constraints.     

An hp finite element method for 4th order singularly perturbed problems

We present the analysis for the hp finite element approximation of the solution to singularly perturbed fourth order problems, using a balanced norm. In Panaseti et al. (2016) it was shown that the hp version of the Finite Element Method (FEM) on the so-called Spectral Boundary Layer Mesh yields robust exponential convergence when the error is measured in the natural energy norm associated with the problem. In the present article we sharpen the result by showing that the same hp-FEM on the Spectral Boundary Layer Mesh gives robust exponential convergence in a stronger, more balanced norm. As a corollary we also get robust exponential convergence in the maximum norm. The analysis is based on the ideas in Roos and Franz (Calcolo 51, 423–440, 2014) and Roos and Schopf (ZAMM 95, 551–565, 2015) and the recent results in Melenk and Xenophontos (2016). Numerical examples illustrating the theory are also presented.     

Spectral transfer morphisms for unipotent affine Hecke algebras

We classify the spectral transfer morphisms (cf. Opdam in Adv Math 286:912–957, 2016) between affine Hecke algebras associated to the unipotent types of the various inner forms of an unramified absolutely simple algebraic group G defined over a non-archimedean local field k. This turns out to characterize Lusztig’s classification (Lusztig in Int Math Res Not 11:517–589, 1995; in Represent Theory 6:243–289, 2002) of unipotent characters of G in terms of the Plancherel measure, up to diagram automorphisms. As an application of these results, the spectral correspondences associated with such morphisms (Opdam 2016), and some results of Ciubotaru, Kato and Kato [CKK] (also see Ciubotaru and Opdam in A uniform classification of the discrete series representations of affine Hecke algebras. arXiv:1510.07274) we prove a conjecture of Hiraga, Ichino and Ikeda [HII] on formal degrees and adjoint gamma factors in the special case of unipotent discrete series characters of inner forms of unramified simple groups of adjoint type defined over k.     

Local properties of Richardson varieties in the Grassmannian via a bounded Robinson-Schensted-Knuth correspondence

The Richardson variety X _α ^γ in the Grassmannian is defined to be the intersection of the Schubert variety X ^γ and opposite Schubert variety X _α . We give an explicit Gröbner basis for the ideal of the tangent cone at any T-fixed point of X _α ^γ , thus generalizing a result of Kodiyalam-Raghavan (J. Algebra 270(1):28–54, 2003) and Kreiman-Lakshmibai (Algebra, Arithmetic and Geometry with Applications, 2004). Our proof is based on a generalization of the Robinson-Schensted-Knuth (RSK) correspondence, which we call the bounded RSK (BRSK). We use the Gröbner basis result to deduce a formula which computes the multiplicity of X _α ^γ at any T-fixed point by counting families of nonintersecting lattice paths, thus generalizing a result first proved by Krattenthaler (Sém. Lothar. Comb. 45:B45c, 2000/2001; J. Algebr. Comb. 22:273–288, 2005).     

Snarks,Hypohamiltonian Graphs and Non-Supereulerian Graphs

A graph G is hypohamiltonian if it is not Hamiltonian but for each \(v\in V(G)\), the graph \(G-v\) is Hamiltonian. A graph is supereulerian if it has a spanning Eulerian subgraph. A graph G is called collapsible if for every even subset \(R\subseteq V(G)\), there is a spanning connected subgraph H of G such that R is the set of vertices of odd degree in H. A graph is reduced if it has no nontrivial collapsible subgraphs. In this note, we first prove that all hypohamiltonian cubic graphs are reduced non-supereulerian graphs. Then we introduce an operation to construct graphs from hypohamiltonian cubic graphs such that the resulting graphs are 3-edge-connected non-supereulerian reduced graphs and cannot be contracted to a snark. This disproves two conjectures, one of which was first posed by Catlin et al. in [Congr. Num. 76:173–181, 1990] and in [J. Combin. Theory, Ser B 66:123–139, 1996], and was posed again by Li et al. in [Acta Math. Sin. English Ser 30(2):291–304, 2014] and by Yang in [Supereulerian graphs, hamiltonicity of graphs and several extremal problems in graphs, Ph. D. Dissertation, Université Paris-Sub, September 27, 2013], respectively, the other one was posed by Yang 2013.     

Symmetries on the Lattice of <Emphasis Type="Italic">k</Emphasis>-Bounded Partitions

In 2002, Suter [25] identified a dihedral symmetry on certain order ideals in Young’s lattice and gave a combinatorial action on the partitions in these order ideals. Viewing this result geometrically, the order ideals can be seen to be in bijection with the alcoves in a 2- fold dilation in the geometric realization of the affine symmetric group. By considering the m-fold dilation we observe a larger set of order ideals in the k-bounded partition lattice that was considered by Lapointe, Lascoux, and Morse [14] in the study of k-Schur functions. We identify the order ideal and the cyclic action on it explicitly in a geometric and combinatorial form.     

Dependence structure and test of independence for some well-known bivariate distributions

In this paper, we study the dependence structure of some bivariate distribution functions based on dependence measures of Kochar and Gupta (Biometrika 74(3):664–666, 1987) and Shetty and Pandit (Stat Methods Appl 12:5–17, 2003) and then compare these measures with Spearman’s rho and Kendall’s tau. Moreover, the empirical power of the class of distribution-free tests introduced by Kochar and Gupta (1987) and Shetty and Pandit (2003) is computed based on exact and asymptotic distribution of U-statistics. Our results are obtained from simulation work in some continuous bivariate distributions for the sample of sizes \(n=6,8,15,20\) and 50. Also, we apply some examples to illustrate the results. Finally, we compare the common estimators of dependence parameter based on empirical MSE.