A new class of bent and hyper-bent Boolean functions in polynomial forms

Bent functions are maximally nonlinear Boolean functions and exist only for functions with even number of inputs. This paper is a contribution to the construction of bent functions over ${\mathbb{F}_{2^{n}}}$ (n = 2m) having the form ${f(x) = tr_{o(s_1)} (a x^ {s_1}) + tr_{o(s_2)} (b x^{s_2})}$ where o(s _i ) denotes the cardinality of the cyclotomic class of 2 modulo 2 ⁿ ? 1 which contains s _i and whose coefficients a and b are, respectively in ${F_{2^{o(s_1)}}}$ and ${F_{2^{o(s_2)}}}$ . Many constructions of monomial bent functions are presented in the literature but very few are known even in the binomial case. We prove that the exponents s ₁ = 2 ^m ? 1 and ${s_2={\frac {2^n-1}3}}$ , where ${a\in\mathbb{F}_{2^{n}}}$ (a ?? 0) and ${b\in\mathbb{F}_{4}}$ provide a construction of bent functions over ${\mathbb{F}_{2^{n}}}$ with optimum algebraic degree. For m odd, we give an explicit characterization of the bentness of these functions, in terms of the Kloosterman sums. We generalize the result for functions whose exponent s ₁ is of the form r(2 ^m ? 1) where r is co-prime with 2 ^m  + 1. The corresponding bent functions are also hyper-bent. For m even, we give a necessary condition of bentness in terms of these Kloosterman sums.     

Geodesic distance for right invariant Sobolev metrics of fractional order on the diffeomorphism group

We study Sobolev-type metrics of fractional order s ≥ 0 on the group Diff _c (M) of compactly supported diffeomorphisms of a manifold M. We show that for the important special case M = S ¹, the geodesic distance on Diff _c (S ¹) vanishes if and only if ${s\leq\frac12}$ . For other manifolds, we obtain a partial characterization: the geodesic distance on Diff _c (M) vanishes for ${M=\mathbb{R}\times N, s < \frac12}$ and for ${M=S^1\times N, s\leq\frac12}$ , with N being a compact Riemannian manifold. On the other hand, the geodesic distance on Diff _c (M) is positive for ${{\rm dim}(M)=1, s > \frac12}$ and dim(M) ≥ 2, s ≥ 1. For ${M=\mathbb{R}^n}$ , we discuss the geodesic equations for these metrics. For n = 1, we obtain some well-known PDEs of hydrodynamics: Burgers’ equation for s = 0, the modified Constantin–Lax–Majda equation for ${s=\frac12}$ , and the Camassa–Holm equation for s = 1.     

Jacobians of Sobolev homeomorphisms

Let ${\Omega\subset\mathbb{R}^{n}}$ be a domain. We show that each homeomorphism f in the Sobolev space ${W^{1,1}_{\rm loc}(\Omega,\mathbb{R}^{n})}$ satisfies either J _f  ≥ 0 a.e or J _f  ≤ 0 a.e. if n = 2 or n = 3. For n > 3 we prove the same conclusion under the stronger assumption that ${f\in W^{1,s}_{\rm loc}(\Omega,\mathbb{R}^{n})}$ for some s > [n/2] (or in the setting of Lorentz spaces).     

2-Reducible Two Paths and an Edge Constructing a Path in (2k + 1)-Edge-Connected Graphs

Let k ≥ 5 be an odd integer and G = (V(G), E(G)) be a k-edge-connected graph. For ${X\subseteq V(G),e(X)}$ denotes the number of edges between X and V(G) ? X. We here prove that if ${\{s_i,t_i\}\subseteq X_i\subseteq V(G)(i=1,2),f}$ is an edge between s ₁ and ${s_2,X_1\cap X_2=\emptyset,e(X_1)\le 2k-3,e(X_2)\le 2k-2}$ , and e(Y) ≥ k + 1 for each ${Y\subseteq V(G)}$ with ${Y\cap\{s_1,t_1,s_2,t_2\}=\{s_1,t_2\}}$ , then there exist paths P ₁ and P ₂ such that P _i joins s _i and ${t_i,V(P_i)\subseteq X_i}$ (i = 1, 2) and ${G-f-E(P_1\cup P_2)}$ is (k ? 2)-edge-connected, and in fact we give a generalization of this result.     

On the Schröder equation and iterative sequences of C r diffeomorphisms in {\mathbb{R}^{N}} space

Let ${U \subset \mathbb{R}^{N}}$ be a neighbourhood of the origin and a function ${F:U\rightarrow U}$ be of class C ^r , r ≥ 2, F(0) = 0. Denote by F ⁿ the n-th iterate of F and let ${0<|s_1|\leq \cdots \leq|s_N| <1 }$ , where ${s_1, \ldots , s_N}$ are the eigenvalues of dF(0). Assume that the Schröder equation ${\varphi(F(x))=S\varphi(x)}$ , where S: = dF(0) has a C ² solution φ such that dφ(0) = id. If ${\frac{log|s_1|}{log|s_N|} <2 }$ then the sequence {S ^?n F ⁿ (x)} converges for every point x from the basin of attraction of F to a C ² solution φ of (1). If ${2\leq\frac{log|s_1|}{log|s_N|} }$ then this sequence can be diverging. In this case we give some sufficient conditions for the convergence and divergence of the sequence {S ^?n F ⁿ (x)}. Moreover, we show that if F is of class C ^r and ${r>\big[\frac{log|s_1|}{log|s_N|} \big ]:=p \geq 2}$ then every C ^r solution of the Schröder equation such that dφ(0) = id is given by the formula $$\begin{array}{ll}\varphi (x)={\lim\limits_{n \rightarrow \infty}} (S^{-n}F^n(x) + {\sum\limits _{k=2}^{p}} S^{-n}L_k (F^n(x))),\end{array}$$ where ${L_k:\mathbb{R}^{N} \rightarrow \mathbb{R}^{N}}$ are some homogeneous polynomials of degree k, which are determined by the differentials d ^(j) F(0) for 1 < j ≤  p.     

Total curvature and L 2 harmonic 1-forms on complete submanifolds in space forms

Let M ⁿ be an n-dimensional complete noncompact oriented submanifold with finite total curvature, i.e., ${\int_M(|A|^2-n|H|^2)^{\frac n2} < \infty}$ , in an (n + p)-dimensional simply connected space form N ^n+p (c) of constant curvature c, where |H| and |A|² are the mean curvature and the squared length of the second fundamental form of M, respectively. We prove that if M satisfies one of the following: (i) n ≥ 3, c = 0 and ${\int_M|H|^n < \infty}$ ; (ii) n ≥ 5, c = ?1 and ${|H| < 1-\frac{2}{\sqrt n}}$ ; (iii) n ≥ 3, c = 1 and |H| is bounded, then the dimension of the space of L ² harmonic 1-forms on M is finite. Moreover, in the case of (i) or (ii), M must have finitely many ends.     

On the Laplace equation with a supercritical nonlinear Robin boundary condition in the half-space

We study the Laplace equation in the half-space ${\mathbb{R}_{+}^{n}}$ with a nonlinear supercritical Robin boundary condition ${\frac{\partial u}{\partial\eta }+\lambda u=u\left\vert u\right\vert^{\rho-1}+f(x)}$ on ${\partial \mathbb{R}_{+}^{n}=\mathbb{R}^{n-1}}$ , where n ≥ 3 and λ ≥ 0. Existence of solutions ${u \in E_{pq}= \mathcal{D}^{1, p}(\mathbb{R}_{+}^{n}) \cap L^{q}(\mathbb{R}_{+}^{n})}$ is obtained by means of a fixed point argument for a small data $f \in {L^{d}(\mathbb{R}^{n-1})}$ . The indexes p, q are chosen for the norm ${\Vert\cdot\Vert_{E_{pq}}}$ to be invariant by scaling of the boundary problem. The solution u is positive whether f(x) > 0 a.e. ${x\in\mathbb{R}^{n-1}}$ . When f is radially symmetric, u is invariant under rotations around the axis {x _n  = 0}. Moreover, in a certain L ^q -norm, we show that solutions depend continuously on the parameter λ ≥ 0.     

Local probabilities for random walks conditioned to stay positive

Let S ₀ = 0, {S _n , n ≥ 1} be a random walk generated by a sequence of i.i.d. random variables X ₁, X ₂, . . . and let $\tau ^{-}={\rm min} \{ n \geq 1:S_{n}\leq 0 \}$ and $\tau ^{+}={\rm min}\{n\geq1:S_{n} > 0\} $ . Assuming that the distribution of X ₁ belongs to the domain of attraction of an α-stable law we study the asymptotic behavior, as ${n\rightarrow \infty }$ , of the local probabilities ${\bf P}{(\tau ^{\pm }=n)}$ and prove the Gnedenko and Stone type conditional local limit theorems for the probabilities ${\bf P}{(S_{n} \in [x,x+\Delta )|\tau^{-} > n)}$ with fixed Δ and ${x=x(n)\in (0,\infty )}$ .     

A note on quadratic convergence of a smoothing Newton algorithm for the LCP

The linear complementarity problem (LCP) is to find ${(x,s)\in\mathfrak{R}^n\times\mathfrak{R}^n}$ such that (x, s) ≥ 0, s = Mx + q, x ^T s = 0 with ${M\in\mathfrak{R}^{n\times n}}$ and ${q\in\mathfrak{R}^n}$ . The smoothing Newton algorithm is one of the most efficient methods for solving the LCP. To the best of our knowledge, the best local convergence results of the smoothing Newton algorithm for the LCP up to now were obtained by Huang et al. (Math Program 99:423–441, 2004). In this note, by using a revised Chen–Harker–Kanzow–Smale smoothing function, we propose a variation of Huang–Qi–Sun’s algorithm and show that the algorithm possesses better local convergence properties than those given in Huang et al. (Math Program 99:423–441, 2004).     

Ramanujan summation and the exponential generating function \sum_{k=0}^{\infty}\frac{z^{k}}{k!}\zeta^{\prime}(-k)

In the sixth chapter of his notebooks, Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula to the partial sums of the series. This method is now called the Ramanujan summation process. In this paper we calculate the Ramanujan sum of the exponential generating functions ∑ _n≥1log?n e ^nz and $\sum_{n\geq 1}H_{n}^{(j)}~e^{-nz}$ where $H_{n}^{(j)}=\sum_{m=1}^{n}\frac{1}{m^{j}}$ . We find a surprising relation between the two sums when j=1 from which follows a formula that connects the derivatives of the Riemann zeta-function at the negative integers to the Ramanujan sum of the divergent Euler sums ∑ _n≥1 n ^k H _n , k ≥ 0, where $H_{n}=H_{n}^{(1)}$ . Further, we express our results on the Ramanujan summation in terms of the classical summation process called the Borel sum.     

Reduction of symmetric semidefinite programs using the regular \ast-representation

We consider semidefinite programming problems on which a permutation group is acting. We describe a general technique to reduce the size of such problems, exploiting the symmetry. The technique is based on a low-order matrix $*$ -representation of the commutant (centralizer ring) of the matrix algebra generated by the permutation matrices. We apply it to extending a method of de Klerk et al. that gives a semidefinite programming lower bound to the crossing number of complete bipartite graphs. It implies that cr(K _8,n ) ≥ 2.9299n ² ? 6n, cr(K _9,n ) ≥ 3.8676n ² ? 8n, and (for any m ≥ 9) $$\lim_{n\to\infty}\frac{{\rm cr}(K_{m,n})}{Z(m,n)}\geq 0.8594\frac{m}{m-1},$$ where Z(m,n) is the Zarankiewicz number $\lfloor\frac{1}{4}(m-1)^2\rfloor\lfloor\frac{1}{4}(n-1)^2\rfloor$ , which is the conjectured value of cr(K _m,n ). Here the best factor previously known was 0.8303 instead of 0.8594.     

A Hardy type inequality for W m,1(0, 1) functions

In this paper, we consider functions ${u\in W^{m,1}(0,1)}$ where m ≥ 2 and u(0) = Du(0) = · · · = D ^m-1 u(0) = 0. Although it is not true in general that ${\frac{D^ju(x)}{x^{m-j}} \in L^1(0,1)}$ for ${j\in \{0,1,\ldots,m-1\}}$ , we prove that ${\frac{D^ju(x)}{x^{m-j-k}} \in W^{k,1}(0,1)}$ if k ≥ 1 and 1 ≤ j + k ≤ m, with j, k integers. Furthermore, we have the following Hardy type inequality, $$\left\|{D^k\left({\frac{D^ju(x)}{x^{m-j-k}}}\right)}\right\|_{L^1(0,1)} \leq \frac {(k-1)!}{(m-j-1)!} \|{D^mu}\|_{L^1(0,1)},$$ where the constant is optimal.     

Uniqueness of non-linear ground states for fractional Laplacians in {\mathbb{R}}

We prove uniqueness of ground state solutions Q = Q(|x|) ≥ 0 of the non-linear equation $$(-\Delta)^s Q+Q-Q^{\alpha+1}= 0 \quad {\rm in} \, \mathbb{R},$$ ( ? Δ ) s Q + Q ? Q α + 1 = 0 i n R , where 0 < s < 1 and 0 < α < 4s/(1?2s) for ${s<\frac{1}{2}}$ s < 1 2 and 0 < α < ∞ for ${s\geq \frac{1}{2}}$ s ≥ 1 2 . Here (?Δ) ^s denotes the fractional Laplacian in one dimension. In particular, we answer affirmatively an open question recently raised by Kenig–Martel–Robbiano and we generalize (by completely different techniques) the specific uniqueness result obtained by Amick and Toland for ${s=\frac{1}{2}}$ s = 1 2 and α = 1 in [5] for the Benjamin–Ono equation. As a technical key result in this paper, we show that the associated linearized operator L ₊ = (?Δ) ^s +1?(α+1)Q ^α is non-degenerate; i.e., its kernel satisfies ker L ₊ = span{Q′}. This result about L ₊ proves a spectral assumption, which plays a central role for the stability of solitary waves and blowup analysis for non-linear dispersive PDEs with fractional Laplacians, such as the generalized Benjamin–Ono (BO) and Benjamin–Bona–Mahony (BBM) water wave equations.     

Über arithmetische Eigenschaften von Lückenreihen mit algebraischen Koeffizienten und algebraischem Argument

Let \(f(z) = \sum\limits_{h = 0}^\infty {f_h z^h } \) be a power series with positive radius of convergenceR _f ≤1,f _h algebraic and lacunary in the following sense: Let {r _n }, {s _n } be two infinite sequences of integers, satisfying $$0 = s_0 \leqslant r_1< s_1 \leqslant r_2< s_2 \leqslant r_3< s_3 \leqslant ..., \mathop {lim}\limits_{n \to \infty } (s_n /F(n)) = \infty $$ such that $$f_h = 0 if r_n< h< s_n ,f_{r_n } \ne 0,f_{s_n } \ne 0 for n = 1,2,3,...;$$ F(n) denotes a certain function ofn, dependent onr _n and \(f_0 ,f_1 ,f_2 , \ldots f_{r_n } \) . Using ideas from a note ofK. Mahler, among other results the following main theorem is proved: The function valuef(α) (with α algebraic, 0<|α|<R _f ) is algebraic if and only if there exists a positive integerN=N(α) such that $$P_n (\alpha ): = \sum\limits_{h = s_n }^{r_{n + 1} } {f_h \alpha ^h = 0 for all n \geqslant N.} $$      

On strictly positive solutions for some semilinear elliptic problems

Let B be a ball in ${\mathbb{R}^{N}}$ , N ≥ 1, let m be a possibly discontinuous and unbounded function that changes sign in B and let 0 < p < 1. We study existence and nonexistence of strictly positive solutions for semilinear elliptic problems of the form ${-\Delta u=m(x) u^{p}}$ in B, u = 0 on ?B.     

Nonexistence and multiplicity of solutions to elliptic problems with supercritical exponents

We consider the supercritical problem $$\begin{array}{l}{-}\Delta u=\left\vert u\right\vert ^{p-2}u \; {\rm in} \; \Omega,\quad u=0 \; {\rm on} \; \partial \Omega, \end{array}$$ where Ω is a bounded smooth domain in ${\mathbb{R}^{N}}$ , N ≥ 3, and ${p\geq2^{\ast}:=\frac{2N}{N-2}}$ . Bahri and Coron showed that if Ω has nontrivial homology this problem has a positive solution for p = 2^*. However, this is not enough to guarantee existence in the supercritical case. For ${p\geq\frac{2(N-1)}{N-3}}$ Passaseo exhibited domains carrying one nontrivial homology class in which no nontrivial solution exists. Here we give examples of domains whose homology becomes richer as p increases. More precisely, we show that for ${p>\frac{2(N-k)}{N-k-2}}$ with 1 ≤ k ≤ N?3 there are bounded smooth domains in ${\mathbb{R}^{N}}$ whose cup-length is k + 1 in which this problem does not have a nontrivial solution. For N = 4,8,16 we show that there are many domains, arising from the Hopf fibrations, in which the problem has a prescribed number of solutions for some particular supercritical exponents.     

Smoothness of convolution powers of orbital measures on the symmetric space SU(n)/SO(n)

We prove that if ${\mu _{a}\,{=}\,m_{K}*\delta _{a}*m_{K}}$ is the K-bi-invariant measure supported on the double coset ${KaK\subseteq SU(n)}$ , for K = SO(n), then ${\mu _{a}^{k}}$ is absolutely continuous with respect to the Haar measure on SU(n) for all a not in the normalizer of K if and only if k ≥ n. The measure, μ _a , supported on the minimal dimension double coset has the property that ${\mu _{a}^{n-1}}$ is singular to the Haar measure.     

Two-agent scheduling on uniform parallel machines with min-max criteria

We consider the problem of scheduling two agents A and B on a set of m uniform parallel machines. Each agent is assumed to be independent from the other: agent A and agent B are made up of n _A and n _B jobs, respectively. Each job is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size jobs, i.e. all jobs share the same processing time. Our goal is to minimize two maximum functions associated with agents A and B and referred to as $F_{max}^{A}=\max_{i\in A} f^{A}_{i}(C_{i})$ and $F_{max}^{B}=\max_{i\in B}f^{B}_{i}(C_{i})$ , respectively, with C _i the completion time of job i and $f_{i}^{X}$ a non-decreasing function. These kinds of problems are called multi-agent scheduling problems. As we are dealing with two conflicting criteria, we focus on the calculation of the strict Pareto optima for the $(F_{max}^{A}, F_{max}^{B} )$ criteria vector. In this paper we develop a minimal complete Pareto set enumeration algorithm with time complexity and memory requirements.     

The Cyclomatic Number of a Graph and its Independence Polynomial at −1

If by s _k is denoted the number of independent sets of cardinality k in a graph G, then ${I(G;x)=s_{0}+s_{1}x+\cdots+s_{\alpha}x^{\alpha}}$ is the independence polynomial of G (Gutman and Harary in Utilitas Mathematica 24:97–106, 1983), where α = α(G) is the size of a maximum independent set. The inequality |I (G; ?1)| ≤ 2 ^ν(G), where ν(G) is the cyclomatic number of G, is due to (Engström in Eur. J. Comb. 30:429–438, 2009) and (Levit and Mandrescu in Discret. Math. 311:1204–1206, 2011). For ν(G) ≤ 1 it means that ${I(G;-1)\in\{-2,-1,0,1,2\}.}$ In this paper we prove that if G is a unicyclic well-covered graph different from C ₃, then ${I(G;-1)\in\{-1,0,1\},}$ while if G is a connected well-covered graph of girth ≥ 6, non-isomorphic to C ₇ or K ₂ (e.g., every well-covered tree ≠ K ₂), then I (G; ?1) = 0. Further, we demonstrate that the bounds {?2 ^ν(G), 2 ^ν(G)} are sharp for I (G; ?1), and investigate other values of I (G; ?1) belonging to the interval [?2 ^ν(G), 2 ^ν(G)].