Rigidity of Free Boundary Surfaces in Compact 3-Manifolds with Strictly Convex Boundary

In this paper, we obtain an analogue of Toponogov theorem in dimension 3 for compact manifolds \(M^3\) with nonnegative Ricci curvature and strictly convex boundary \(\partial M\). Here we obtain a sharp upper bound for the length \(L(\partial \Sigma )\) of the boundary \(\partial \Sigma \) of a free boundary minimal surface \(\Sigma ^2\) in \(M^3\) in terms of the genus of \(\Sigma \) and the number of connected components of \(\partial \Sigma \), assuming \(\Sigma \) has index one. After, under a natural hypothesis on the geometry of M along \(\partial M\), we prove that if \(L(\partial \Sigma )\) saturates the respective upper bound, then \(M^3\) is isometric to the Euclidean 3-ball and \(\Sigma ^2\) is isometric to the Euclidean disk. In particular, we get a sharp upper bound for the area of \(\Sigma \), when \(M^3\) is a strictly convex body in \(\mathbb {R}^3\), which is saturated only on the Euclidean 3-balls (by the Euclidean disks). We also consider similar results for free boundary stable CMC surfaces.     

The $$$$-Affine Caacity

In this paper, the \(p\)-affine capacity is introduced for \(1<p<n\) and then developed to discover the upper and lower isocapacitary inequalities that strengthen optimally both the Maz’ya \(p\)-isocapacitary inequality and the Lutwak–Yang–Zhang \(L_p\) affine isoperimetric inequality over the \(n\)-dimensional Euclidean space \({\mathbb {R}}^{n}\).     

Hybrid meta-heuristics with VNS and exact methods: alication to large unconditional and conditional vertex $$$$-centre roblems

Large-scale unconditional and conditional vertex \(p\)-centre problems are solved using two meta-heuristics. One is based on a three-stage approach whereas the other relies on a guided multi-start principle. Both methods incorporate Variable Neighbourhood Search, exact method, and aggregation techniques. The methods are assessed on the TSP dataset which consist of up to 71,009 demand points with \(p\) varying from 5 to 100. To the best of our knowledge, these are the largest instances solved for unconditional and conditional vertex \(p\)-centre problems. The two proposed meta-heuristics yield competitive results for both classes of problems.     

On Locally Gabriel Geometric Graphs

Let \(P\) be a set of \(n\) points in the plane. A geometric graph \(G\) on \(P\) is said to be locally Gabriel if for every edge \((u,v)\) in \(G\), the Euclidean disk with the segment joining \(u\) and \(v\) as diameter does not contain any points of \(P\) that are neighbors of \(u\) or \(v\) in \(G\). A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any \(n\), there exists LGG with \(\Omega (n^{5/4})\) edges. This improves upon the previous best bound of \(\Omega (n^{1+\frac{1}{\log \log n}})\). (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any \(n\) point set, there exists an independent set of size \(\Omega (\sqrt{n}\log n)\).     

Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime power conductor. In particular, these bounds imply Minkowski’s conjecture for totally real number fields of conductor \(p^r\), where \(p\) is an odd prime number and \(r \ge 2\).     

Brownian Paths Homogeneously Distributed in Space: Percolation Phase Transition and Uniqueness of the Unbounded Cluster

We consider a continuum percolation model on \(\mathbb {R}^d\), \(d\ge 1\). For \(t,\lambda \in (0,\infty )\) and \(d\in \{1,2,3\}\), the occupied set is given by the union of independent Brownian paths running up to time t whose initial points form a Poisson point process with intensity \(\lambda >0\). When \(d\ge 4\), the Brownian paths are replaced by Wiener sausages with radius \(r>0\). We establish that, for \(d=1\) and all choices of t, no percolation occurs, whereas for \(d\ge 2\), there is a non-trivial percolation transition in t, provided \(\lambda \) and r are chosen properly. The last statement means that \(\lambda \) has to be chosen to be strictly smaller than the critical percolation parameter for the occupied set at time zero (which is infinite when \(d\in \{2,3\}\), but finite and dependent on r when \(d\ge 4\)). We further show that for all \(d\ge 2\), the unbounded cluster in the supercritical phase is unique. Along the way a finite box criterion for non-percolation in the Boolean model is extended to radius distributions with an exponential tail. This may be of independent interest. The present paper settles the basic properties of the model and should be viewed as a springboard for finer results.     

Stability of Capillary Hypersurfaces with Planar Boundaries

We prove that, in a Euclidean domain bounded by hyperplanes having linearly independent normals, a connected oriented compact immersed stable capillary hypersurface \(M^n\) disjoint from the edges of the domain and with the contact angles belonging to \([\pi /2,\pi ]\) must be part of a sphere, if \(\partial M\) is embedded for \(n=2\), or \(\partial M\) is convex in the hyperplane for \(n\ge 3\). By applying a similar argument, we also discuss two other cases where a stable capillary hypersurface must be part of a sphere.     

Skew-cyclic codes over $$B_k$$

In this paper we study the structure of \(\theta \)-cyclic codes over the ring \(B_k\) including its connection to quasi-\({\tilde{\theta }}\)-cyclic codes over finite field \({\mathbb {F}}_{p^r}\) and skew polynomial rings over \(B_k\). We also characterize Euclidean self-dual \(\theta \)-cyclic codes over the rings. Finally, we give the generator polynomial for such codes and some examples of optimal Euclidean \(\theta \)-cyclic codes.     

Left annihilator of generalized derivations on Lie ideals in prime rings

Let \(R\) be a prime ring, \(L\) a noncentral Lie ideal of \(R\), \(F\) a generalized derivation with associated nonzero derivation \(d\) of \(R\). If \(a\in R\) such that \(a(d(u)^{l_1} F(u)^{l_2} d(u)^{l_3} F(u)^{l_4} \ldots F(u)^{l_k})^{n}=0\) for all \(u\in L\), where \(l_1,l_2,\ldots ,l_k\) are fixed non negative integers not all are zero and \(n\) is a fixed integer, then either \(a=0\) or \(R\) satisfies \(s_4\), the standard identity in four variables.     

The Fischer–Marsden conjecture and contact geometry

In this paper, we consider the Fischer–Marsden conjecture within the frame-work of K-contact manifolds and \((\kappa ,\mu )\)-contact manifolds. First, we prove that a complete K-contact metric satisfying \(\mathcal {L}^{*}_g(\lambda )=0\) is Einstein and is isometric to a unit sphere \(S^{2n+1}\). Next, we prove that if a non-Sasakian \((\kappa ,\mu )\)-contact metric satisfies \(\mathcal {L}^{*}_g(\lambda )=0\), then \( M^{3} \) is flat, and for \(n > 1\), \(M^{2n+1}\) is locally isometric to the product of a Euclidean space \(E^{n+1}\) and a sphere \(S^n(4)\) of constant curvature \(+\,4\).     

On Reachable Families of the Loewner Differential Equation in Several Complex Variables

Graham, Hamada, Kohr and Kohr studied the normalized time \(T\) reachable families \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},\Omega )\) of the Loewner differential equation, which are generated by the Carathéodory mappings with values in a subfamily \(\Omega \) of the Carathéodory family \({\mathcal {N}}_A\) for the Euclidean unit ball \({\mathbb {B}}^n\), where \(A\) is a linear operator with \(k_+(A)<2m(A)\) (\(k_+(A)\) is the Lyapunov index of \(A\) and \(m(A)=\min \{\mathfrak {R}\left\langle Az,z\right\rangle \big |z\in {\mathbb {C}}^n,\Vert z\Vert =1\}\)). They obtained some compactness and density results, as generalizations of related results due to Roth, and conjectured that if \(\Omega \) is compact and convex, then \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},\Omega )\) is compact and \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},ex\,\Omega )\) is dense in \(\widetilde{\mathcal {R}}_T(id_{{\mathbb {B}}^n},\Omega )\), where \(ex\,\Omega \) denotes the corresponding set of extreme points and \(T\in [0,\infty ]\). We confirm this, by embedding the Carathéodory mappings in a suitable Bochner space.     

An $$H^1$$-Galerkin mixed finite element method for time fractional reaction–diffusion equation

In this article, an \(H^1\)-Galerkin mixed finite element (MFE) method for solving time fractional reaction–diffusion equation is presented. The optimal time convergence order \(O(\varDelta t^{2-\alpha })\) and the optimal spatial rate of convergence in \(H^1\) and \(L^2\)-norms for variable \(u\) and its gradient \(\sigma \) are derived. Moreover, some numerical results are shown to support our theoretical analysis.     

Gagliardo-Nirenberg inequalities for differential forms in Heisenberg groups

The \(L^1\)-Sobolev inequality states that for compactly supported functions u on the Euclidean n-space, the \(L^{n/(n-1)}\)-norm of a compactly supported function is controlled by the \(L^1\)-norm of its gradient. The generalization to differential forms (due to Lanzani and Stein and Bourgain and Brezis) is recent, and states that a the \(L^{n/(n-1)}\)-norm of a compactly supported differential h-form is controlled by the \(L^1\)-norm of its exterior differential du and its exterior codifferential \(\delta u\) (in special cases the \(L^1\)-norm must be replaced by the \(\mathcal H^1\)-Hardy norm). We shall extend this result to Heisenberg groups in the framework of an appropriate complex of differential forms.     

Elimination of extremal index zeroes from generic paths of closed $$$$-forms

Let \( \alpha \) be a Morse closed \( 1 \)-form of a smooth \( n \)-dimensional manifold \( M \). The zeroes of \( \alpha \) of index \( 0 \) or \( n \) are called centers. It is known that every non-vanishing de Rham cohomology class \( u \) contains a Morse representative without centers. The result of this paper is the one-parameter analogue of the last statement: every generic path \( (\alpha _t)_{ t\in [0,1] }\) of closed \( 1 \)-forms in a fixed class \( u\ne 0 \) such that \( \alpha _0,\alpha _1 \) have no centers, can be modified relatively to its extremities to another such path \( (\beta _t)_{t \in [0,1]} \) having no center at all.     

Small Littlewood–Richardson coefficients

We develop structural insights into the Littlewood–Richardson graph, whose number of vertices equals the Littlewood–Richardson coefficient \(c_{\lambda ,\mu }^{\nu }\) for given partitions \(\lambda \), \(\mu \), and \(\nu \). This graph was first introduced in Bürgisser and Ikenmeyer (SIAM J Discrete Math 27(4):1639–1681, 2013), where its connectedness was proved. Our insights are useful for the design of algorithms for computing the Littlewood–Richardson coefficient: We design an algorithm for the exact computation of \(c_{\lambda ,\mu }^{\nu }\) with running time \(\mathcal {O}\big ((c_{\lambda ,\mu }^{\nu })^2 \cdot {\textsf {poly}}(n)\big )\), where \(\lambda \), \(\mu \), and \(\nu \) are partitions of length at most n. Moreover, we introduce an algorithm for deciding whether \(c_{\lambda ,\mu }^{\nu } \ge t\) whose running time is \(\mathcal {O}\big (t^2 \cdot {\textsf {poly}}(n)\big )\). Even the existence of a polynomial-time algorithm for deciding whether \(c_{\lambda ,\mu }^{\nu } \ge 2\) is a nontrivial new result on its own. Our insights also lead to the proof of a conjecture by King et al. (Symmetry in physics. American Mathematical Society, Providence, 2004), stating that \(c_{\lambda ,\mu }^{\nu }=2\) implies \(c_{M\lambda ,M\mu }^{M\nu } = M+1\) for all \(M \in \mathbb {N}\). Here, the stretching of partitions is defined componentwise.     

Harmonic Analysis on the Möbius Gyrogroup

In this paper we propose to develop harmonic analysis on the Poincaré ball \({{\mathbb {B}}_{t}^{n}}\), a model of the \(n\)-dimensional real hyperbolic space. The Poincaré ball \({{\mathbb {B}}_{t}^{n}}\) is the open ball of the Euclidean \(n\)-space \(\mathbb {R}^n\) with radius \(t >0\), centered at the origin of \(\mathbb {R}^n\) and equipped with Möbius addition, thus forming a Möbius gyrogroup where Möbius addition in the ball plays the role of vector addition in \(\mathbb {R}^n.\) For any \(t>0\) and an arbitrary parameter \(\sigma \in \mathbb {R}\) we study the \((\sigma ,t)\)-translation, the \((\sigma ,t)\)-convolution, the eigenfunctions of the \((\sigma ,t)\)-Laplace–Beltrami operator, the \((\sigma ,t)\)-Helgason Fourier transform, its inverse transform and the associated Plancherel’s Theorem, which represent counterparts of standard tools, thus, enabling an effective theory of hyperbolic harmonic analysis. Moreover, when \(t \rightarrow +\infty \) the resulting hyperbolic harmonic analysis on \({{\mathbb {B}}_{t}^{n}}\) tends to the standard Euclidean harmonic analysis on \(\mathbb {R}^n,\) thus unifying hyperbolic and Euclidean harmonic analysis. As an application we construct diffusive wavelets on \({{\mathbb {B}}_{t}^{n}}\).     

Partial permutation decoding for binary linear and $$Z_4$$-linear Hadamard codes

In this paper, s-\({\text {PD}}\)-sets of minimum size \(s+1\) for partial permutation decoding for the binary linear Hadamard code \(H_m\) of length \(2^m\), for all \(m\ge 4\) and \(2 \le s \le \lfloor {\frac{2^m}{1+m}}\rfloor -1\), are constructed. Moreover, recursive constructions to obtain s-\({\text {PD}}\)-sets of size \(l\ge s+1\) for \(H_{m+1}\) of length \(2^{m+1}\), from an s-\({\text {PD}}\)-set of the same size for \(H_m\), are also described. These results are generalized to find s-\({\text {PD}}\)-sets for the \({\mathbb {Z}}_4\)-linear Hadamard codes \(H_{\gamma , \delta }\) of length \(2^m\), \(m=\gamma +2\delta -1\), which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type \(2^\gamma 4^\delta \). Specifically, s-PD-sets of minimum size \(s+1\) for \(H_{\gamma , \delta }\), for all \(\delta \ge 3\) and \(2\le s \le \lfloor {\frac{2^{2\delta -2}}{\delta }}\rfloor -1\), are constructed and recursive constructions are described.     

Polynomially linked additive functions—II

We continue the study of additive functions \(f_k:R\rightarrow F \;(1\le k\le n)\) linked by an equation of the form \(\sum _{k=1}^n p_k(x)f_k(q_k(x))=0\), where the \(p_k\) and \(q_k\) are polynomials, R is an integral domain of characteristic 0, and F is the fraction field of R. A method is presented for solving all such equations. We also consider the special case \(\sum _{k=1}^n x^{m_k}f_k(x^{j_k})=0\) in which the \(p_k\) and \(q_k\) are monomials. In this case we show that if there is no duplication, i.e. if \((m_k,j_k)\ne (m_p,j_p)\) for \(k\ne p\), then each \(f_k\) is the sum of a linear function and a derivation of order at most \(n-1\). Furthermore, if this functional equation is not homogeneous then the maximal orders of the derivations are reduced in a specified way.     

Coalescece ad Meetig Times o $$$$-Block Markov Chais

We consider finite-state, discrete-time, mixing Markov chains \((V,P)\), where \(V\) is the state space and \(P\) is the transition matrix. To each such chain \((V,P)\), we associate a sequence of chains \((V_n,P_n)\) by coding trajectories of \((V,P)\) according to their overlapping \(n\)-blocks. The chain \((V_n,P_n)\), called the \(n\)-block Markov chain associated with \((V,P)\), may be considered an alternate version of \((V,P)\) having memory of length \(n\). Along such a sequence of chains, we characterize the asymptotic behavior of coalescence times and meeting times as \(n\) tends to infinity. In particular, we define an algebraic quantity \(L(V,P)\) depending only on \((V,P)\), and we show that if the coalescence time on \((V_n,P_n)\) is denoted by \(C_n\), then the quantity \(\frac{1}{n} \log C_n\) converges in probability to \(L(V,P)\) with exponential rate. Furthermore, we fully characterize the relationship between \(L(V,P)\) and the entropy of \((V,P)\).     

Computing the Permanent of (Some) Complex Matrices

We present a deterministic algorithm, which, for any given \(0< \epsilon < 1\) and an \(n \times n\) real or complex matrix \(A=\left( a_{ij}\right) \) such that \(\left| a_{ij}-1 \right| \le 0.19\) for all \(i, j\) computes the permanent of \(A\) within relative error \(\epsilon \) in \(n^{O\left( \ln n -\ln \epsilon \right) }\) time. The method can be extended to computing hafnians and multidimensional permanents.