Explicit div-curl inequalities in bounded and unbounded domains of $${{\mathbb {R}}}^3$$

We give a constructive proof of some functional inequalities related to the div and curl operators in bounded and unbounded domains of \({{\mathbb {R}}}^3\). Our new innovation consists in giving explicit constants in several geometric configurations. These inequalities are of a first use in solving div-curl systems and vector potential problems arising in physics.     

Primal-dual first-order methods with $${\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming

In this paper we consider the general cone programming problem, and propose primal-dual convex (smooth and/or nonsmooth) minimization reformulations for it. We then discuss first-order methods suitable for solving these reformulations, namely, Nesterov’s optimal method (Nesterov in Doklady AN SSSR 269:543–547, 1983; Math Program 103:127–152, 2005), Nesterov’s smooth approximation scheme (Nesterov in Math Program 103:127–152, 2005), and Nemirovski’s prox-method (Nemirovski in SIAM J Opt 15:229–251, 2005), and propose a variant of Nesterov’s optimal method which has outperformed the latter one in our computational experiments. We also derive iteration-complexity bounds for these first-order methods applied to the proposed primal-dual reformulations of the cone programming problem. The performance of these methods is then compared using a set of randomly generated linear programming and semidefinite programming instances. We also compare the approach based on the variant of Nesterov’s optimal method with the low-rank method proposed by Burer and Monteiro (Math Program Ser B 95:329–357, 2003; Math Program 103:427–444, 2005) for solving a set of randomly generated SDP instances.     

A generalized elastic net regularization with smoothed $$\ell _{q}$$ penalty for sparse vector recovery

In this paper, we propose an iterative algorithm for solving the generalized elastic net regularization problem with smoothed \(\ell _{q} (0<q \le 1)\) penalty for recovering sparse vectors. We prove the convergence result of the algorithm based on the algebraic method. Under certain conditions, we show that the iterative solutions converge to a local minimizer of the generalized elastic net regularization problem and we also present an error bound. Theoretical analysis and numerical results show that the proposed algorithm is promising.     

An O（rL） Infeasible Interior-point Algorithm for Symmetric Cone LCP via CHKS Function

In this paper, we propose a theoretical framework of an infeasible interior-point algorithm for solving monotone linear cornplementarity problems over symmetric cones （SCLCP）. The new algorithm gets Newton-like directions from the Chen-Harker-Kanzow-Smale （CHKS） smoothing equation of the SCLCP. It possesses the following features： The starting point is easily chosen; one approximate Newton step is computed and accepted at each iteration; the iterative point with unit stepsize automatically remains in the neighborhood of central path; the iterative sequence is bounded and possesses （9（rL） polynomial-time complexity under the monotonicity and solvability of the SCLCP.     

NONVANISHING OF CONFORMAL BLOCKS DIVISORS ON $$ {\overline{\mathrm{M}}}_{0,n} $$

We introduce and study the problem of finding necessary and sufficient conditions under which a conformal blocks divisor on \( {\overline{\mathrm{M}}}_{0,n} \) is nonzero, solving the problem completely for \( \mathfrak{s}{\mathfrak{l}}_2 \). We give necessary nonvanishing conditions in type A, which are sufficient when theta and critical levels coincide. We also show divisors are subject to additive identities, reflecting a decomposition of the weights and level.     

Random embedding of $${\ell_p^n}$$ into $${\ell_r^N}$$

For any 0 < p < 2 and any natural numbers N > n, we give an explicit definition of a random operator \({S : \ell_p^n \to \mathbb{R}^N}\) such that for every 0 < r < p < 2 with r ≤ 1, the operator \({S_r = S : \ell_p^n \to \ell_r^N}\) satisfies with overwhelming probability that \({\|S_r\| \, \|(S_r)_{| {\rm Im}\, S}^{-1}\| \le C(p,r)^{n/(N-n)}}\), where C(p, r) > 0 is a real number depending only on p and r. One of the main tools that we develop is a new type of multidimensional Esseen inequality for studying small ball probabilities.     

Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$

This paper describes an algorithm for solving structured nonsmooth convex optimization problems using the optimal subgradient algorithm (OSGA), which is a first-order method with the complexity \(\mathcal {O}(\varepsilon ^{-2})\) for Lipschitz continuous nonsmooth problems and \(\mathcal {O}(\varepsilon ^{-1/2})\) for smooth problems with Lipschitz continuous gradient. If the nonsmoothness of the problem is manifested in a structured way, we reformulate the problem so that it can be solved efficiently by a new setup of OSGA (called OSGA-V) with the complexity \(\mathcal {O}(\varepsilon ^{-1/2})\). Further, to solve the reformulated problem, we equip OSGA-O with an appropriate prox-function for which the OSGA-O subproblem can be solved either in a closed form or by a simple iterative scheme, which decreases the computational cost of applying the algorithm for large-scale problems. We show that applying the new scheme is feasible for many problems arising in applications. Some numerical results are reported confirming the theoretical foundations.     

On $$\ell $$-regular bipartitions modulo $$\ell $$

Let \(B_\ell (n)\) denote the number of \(\ell \)-regular bipartitions of n. In this paper, we prove several infinite families of congruences satisfied by \(B_\ell (n)\) for \(\ell \in {\{5,7,13\}}\). For example, we show that for all \(\alpha >0\) and \(n\ge 0\),

$$\begin{aligned} B_5\left( 4^\alpha n+\frac{5\times 4^\alpha -2}{6}\right)\equiv & {} 0 \ (\text {mod}\ 5),\\ B_7\left( 5^{8\alpha }n+\displaystyle \frac{5^{8\alpha }-1}{2}\right)\equiv & {} 3^\alpha B_7(n)\ (\text {mod}\ 7) \end{aligned}$$

and

$$\begin{aligned} B_{13}\left( 5^{12\alpha }n+5^{12\alpha }-1\right) \equiv B_{13}(n)\ (\text {mod}\ 13). \end{aligned}$$

     

Actions of the groups $${\mathbb C}$$ and $${\mathbb C^*}$$ on Stein varieties

In this paper we present recent results concerning global aspects of and -actions on Stein surfaces. Our approach is based on a byproduct of techniques from Geometric Theory of Foliations (holonomy, stability), Potential theory (parabolic Riemann surfaces, Riemann-Koebe Uniformization theorem) and Several Complex Variables (Hartogs’ extension theorems, Theory of Stein spaces). Our main motivation comes from the original works of M. Suzuki and Orlik-Wagreich. Some of their results are extended to a more general framework. In particular, we prove some linearization theorems for holomorphic actions of and on normal Stein analytic spaces of dimension two. We also add a list of questions and open problems in the subject. The underlying idea is to present the state of the art of this research field.      

On the Enumeration of Labeled Series-Parallel $$k $$ -Cyclic $$2 $$ -Connected Graphs

Journal of Applied and Industrial Mathematics - We deduce an explicit formula for the number of labeled series-parallel $$k $$ -cyclic $$n $$ -vertex $$2 $$ -connected graphs and find the...     

The $$ \ell _1 $$-Analysis in Phase Retrieval with Redundant Dictionary

This article presents new results concerning the recovery of a signal from the magnitude only measurements where the signal is not sparse in an orthonormal basis but in a redundant dictionary, which we call it phase retrieval with redundant dictionary for short. To solve this phaseless problem, we analyze the \( \ell _1 \)-analysis model. Firstly we investigate the noiseless case with presenting a null space property of the measurement matrix under which the \( \ell _1 \)-analysis model provides an exact recovery. Secondly we introduce a new property (S-DRIP) of the measurement matrix. By solving the \( \ell _1 \)-analysis model, we prove that this property can guarantee a stable recovery of real signals that are nearly sparse in overcomplete dictionaries.     

Locally Tabular $$\ne $$ Locally Finite

We show that for an arbitrary logic being locally tabular is a strictly weaker property than being locally finite. We describe our hunt for a logic that allows us to separate the two properties, revealing weaker and weaker conditions under which they must coincide, and showing how they are intertwined. We single out several classes of logics where the two notions coincide, including logics that are determined by a finite set of finite matrices, selfextensional logics, algebraizable and equivalential logics. Furthermore, we identify a closure property on models of a logic that, in the presence of local tabularity, is equivalent to local finiteness.     

The $${\mathbb {Q}}$$ Q -Korselt set of $$\mathrm {pq}$$ pq

Periodica Mathematica Hungarica - Let N be a positive integer, $${\mathbb {A}}$$ be a nonempty subset of $${\mathbb {Q}}$$ and $$\alpha =\dfrac{\alpha _{1}}{\alpha _{2}}\in {\mathbb {A}}{\setminus...     

$${{\mathcal {D}(\mathcal {C})}}$$-optimization and robust global optimization

For solving global optimization problems with nonconvex feasible sets existing methods compute an approximate optimal solution which is not guaranteed to be close, within a given tolerance, to the actual optimal solution, nor even to be feasible. To overcome these limitations, a robust solution approach is proposed that can be applied to a wide class of problems called D(C){{\mathcal {D}(\mathcal {C})}}-optimization problems. DC optimization and monotonic optimization are particular cases of D(C){{\mathcal {D}(\mathcal {C})}}-optimization, so this class includes virtually every nonconvex global optimization problem of interest. The approach is a refinement and extension of an earlier version proposed for dc and monotonic optimization.     

$${\cal K}$$-Convexity1 in $$\Re^{n}$$

We generalize the concept of K-convexity to an n-dimensional Euclidean space. The resulting concept of -convexity is useful in addressing production and inventory problems where there are individual product setup costs and/or joint setup costs. We derive some basic properties of -convex functions. We conclude the paper with some suggestions for future research. Support from Columbia University and University of Texas at Dallas is gratefully acknowledged. Helpful comments from Qi Feng are appreciated.     

Volume preserving subgroups of $${{\mathcal A}}$$ and $${{\mathcal K}}$$ and singularities in unimodular geometry

For a germ of a smooth map f from \mathbb Kⁿ{{\mathbb K}^n} to \mathbb K^p{{\mathbb K}^p} and a subgroup G_Wq{{{G}_{\Omega _q}}} of any of the Mather groups G for which the source or target diffeomorphisms preserve some given volume form Ω _q in \mathbb K^q{{\mathbb K}^q} (q = n or p) we study the G_Wq{{{G}_{\Omega _q}}} -moduli space of f that parameterizes the G_Wq{{{G}_{\Omega _q}}} -orbits inside the G-orbit of f. We find, for example, that this moduli space vanishes for G_Wq = A_Wp{{{G}_{\Omega _q}} ={{\mathcal A}_{\Omega _p}}} and A{{\mathcal A}}-stable maps f and for G_Wq = K_Wn{{{G}_{\Omega _q}} ={{\mathcal K}_{\Omega _n}}} and K{{\mathcal K}}-simple maps f. On the other hand, there are A{{\mathcal A}}-stable maps f with infinite-dimensional A_Wn{{{\mathcal A}_{\Omega _n}}} -moduli space.     

$$\pi $$π-Formulas and Gray code

In previous papers we introduced a class of polynomials which follow the same recursive formula as the Lucas–Lehmer numbers, studying the distribution of their zeros and remarking that this distribution follows a sequence related to the binary Gray code. It allowed us to give an order for all the zeros of every polynomial \(L_n\). In this paper, the zeros, expressed in terms of nested radicals, are used to obtain two formulas for \(\pi \): the first can be seen as a generalization of the known formula

$$\begin{aligned} \pi =\lim _{n\rightarrow \infty } 2^{n+1}\cdot \sqrt{2-\underbrace{\sqrt{2+\sqrt{2+\sqrt{2+\cdots +\sqrt{2}}}}}_{n}}, \end{aligned}$$

related to the smallest positive zero of \(L_n\); the second is an exact formula for \(\pi \) achieved thanks to some identities valid for \(L_n\).

     

n-APR tilting and $$\tau $$ τ -mutations

Journal of Algebraic Combinatorics - APR tilts for path algebra kQ can be realized as the mutation of the quiver Q in $${\mathbb Z}Q$$ with respect to the translation. In this paper, we show that...     

$$\Gamma $$ Γ -evaluations of hypergeometric series

The Ramanujan Journal - In this paper we explore special values of Gaussian hypergeometric functions in terms of products of Euler $$\Gamma $$ -functions and exponential functions of linear...     

Beckman-Quarles type theorems for mappings from $$ \mathbb{R}^n $$ to $$ \mathbb{C}^n $$

Summary. Let We say that preserves the distance d 0 if for each implies Let A _n denote the set of all positive numbers d such that any map that preserves unit distance preserves also distance d. Let D _n denote the set of all positive numbers d with the property: if and then there exists a finite set S _xy with such that any map that preserves unit distance preserves also the distance between x and y. Obviously, We prove: (1) (2) for n 2 D _n is a dense subset of (2) implies that each mapping f from to (n 2) preserving unit distance preserves all distances, if f is continuous with respect to the product topologies on and