More Like this

1. Sparse representation of vectors in lattices and semigroups

   https://doi.org/10.1007/s10107-021-01657-8  

   Aliev, Iskander; Averkov, Gennadiy; De_Loera, Jesús_A; Oertel, Timm (May 2021, Mathematical Programming)

   Abstract We study the sparsity of the solutions to systems of linear Diophantine equations with and without non-negativity constraints. The sparsity of a solution vector is the number of its nonzero entries, which is referred to as the$$\ell _0$$ ${\ell }_0$-norm of the vector. Our main results are new improved bounds on the minimal$$\ell _0$$ ${\ell }_0$-norm of solutions to systems$$A\varvec{x}=\varvec{b}$$ $Ax=b$, where$$A\in \mathbb {Z}^{m\times n}$$ $A\in Z^{m\times n}$,$${\varvec{b}}\in \mathbb {Z}^m$$ $b\in Z^m$and$$\varvec{x}$$ $x$is either a general integer vector (lattice case) or a non-negative integer vector (semigroup case). In certain cases, we give polynomial time algorithms for computing solutions with$$\ell _0$$ ${\ell }_0$-norm satisfying the obtained bounds. We show that our bounds are tight. Our bounds can be seen as functions naturally generalizing the rank of a matrix over$$\mathbb {R}$$ $R$, to other subdomains such as$$\mathbb {Z}$$ $Z$. We show that these new rank-like functions are all NP-hard to compute in general, but polynomial-time computable for fixed number of variables. 

   more » « less
2. Planar chemical reaction systems with algebraic and non-algebraic limit cycles

   https://doi.org/10.1007/s00285-025-02221-0  

   Craciun, Gheorghe; Erban, Radek (May 2025, Journal of Mathematical Biology)

   Abstract The Hilbert numberH(n) is defined as the maximum number of limit cycles of a planar autonomous system of ordinary differential equations (ODEs) with right-hand sides containing polynomials of degree at most$$n \in {{\mathbb {N}}}$$ $n\in N$. The dynamics of chemical reaction systems with two chemical species can be (under mass-action kinetics) described by such planar autonomous ODEs, wherenis equal to the maximum order of the chemical reactions in the system. Analogues of the Hilbert number H(n) for three different classes of chemical reaction systems are investigated: (i) chemical systems with reactions up to then-th order; (ii) systems with up ton-molecular chemical reactions; and (iii) weakly reversible chemical reaction networks. In each case (i), (ii) and (iii), the question on the number of limit cycles is considered. Lower bounds on the modified Hilbert numbers are provided for both algebraic and non-algebraic limit cycles. Furthermore, given a general algebraic curve$$h(x,y)=0$$ $h(x,y)=0$of degree$$n_h \in {{\mathbb {N}}}$$ $n_h\in N$and containing one or more ovals in the positive quadrant, a chemical system is constructed which has the oval(s) as its stable algebraic limit cycle(s). The ODEs describing the dynamics of the constructed chemical system contain polynomials of degree at most$$n=2\,n_h+1.$$ $n=2n_h+1.$Considering$$n_h \ge 4,$$ $n_h\ge 4,$the algebraic curve$$h(x,y)=0$$ $h(x,y)=0$can contain multiple closed components with the maximum number of ovals given by Harnack’s curve theorem as$$1+(n_h-1)(n_h-2)/2$$ $1+(n_h-1)(n_h-2)/2$, which is equal to 4 for$$n_h=4.$$ $n_h=4.$Algebraic curve$$h(x,y)=0$$ $h(x,y)=0$with$$n_h=4$$ $n_h=4$and the maximum number of four ovals is used to construct a chemical system which has four stable algebraic limit cycles. 

   more » « less
3. Restricted spaces of holomorphic sections vanishing along subvarieties

   https://doi.org/10.1007/s00209-025-03706-w  

   Coman, Dan; Marinescu, George; Nguyên, Viêt-Anh (May 2025, Mathematische Zeitschrift)

   Abstract LetXbe a compact normal complex space of dimensionnandLbe a holomorphic line bundle onX. Suppose that$$\Sigma =(\Sigma _1,\ldots ,\Sigma _\ell )$$ $\Sigma =({\Sigma }_1,\dots ,{\Sigma }_{\ell })$is an$$\ell $$ $\ell$-tuple of distinct irreducible proper analytic subsets ofX,$$\tau =(\tau _1,\ldots ,\tau _\ell )$$ $\tau =({\tau }_1,\dots ,{\tau }_{\ell })$is an$$\ell $$ $\ell$-tuple of positive real numbers, and let$$H^0_0(X,L^p)$$ $H_0^0(X,L^p)$be the space of holomorphic sections of$$L^p:=L^{\otimes p}$$ $L^p:=L^{\otimes p}$that vanish to order at least$$\tau _jp$$ ${\tau }_{j}p$along$$\Sigma _j$$ ${\Sigma }_j$,$$1\le j\le \ell $$ $1\le j\le \ell$. If$$Y\subset X$$ $Y\subset X$is an irreducible analytic subset of dimensionm, we consider the space$$H^0_0 (X|Y, L^p)$$ $H_0^0\left(X\right|Y,L^p)$of holomorphic sections of$$L^p|_Y$$ $L^p{|}_Y$that extend to global holomorphic sections in$$H^0_0(X,L^p)$$ $H_0^0(X,L^p)$. Assuming that the triplet$$(L,\Sigma ,\tau )$$ $(L,\Sigma ,\tau )$is big in the sense that$$\dim H^0_0(X,L^p)\sim p^n$$ $dim{H}_0^0(X,L^p)\sim p^n$, we give a general condition onYto ensure that$$\dim H^0_0(X|Y,L^p)\sim p^m$$ $dim{H}_0^0\left(X\right|Y,L^p)\sim p^m$. WhenLis endowed with a continuous Hermitian metric, we show that the Fubini-Study currents of the spaces$$H^0_0(X|Y,L^p)$$ $H_0^0\left(X\right|Y,L^p)$converge to a certain equilibrium current onY. We apply this to the study of the equidistribution of zeros inYof random holomorphic sections in$$H^0_0(X|Y,L^p)$$ $H_0^0\left(X\right|Y,L^p)$as$$p\rightarrow \infty $$ $p\to \infty$. 

   more » « less
4. Inexact Fixed-Point Proximity Algorithm for the $$\ell _0$$ Sparse Regularization Problem

   https://doi.org/10.1007/s10915-024-02600-7  

   Fang, Ronglong; Xu, Yuesheng; Yan, Mingsong (July 2024, Journal of Scientific Computing)

   Abstract We studyinexactfixed-point proximity algorithms for solving a class of sparse regularization problems involving the$$\ell _0$$ ${\ell }_0$norm. Specifically, the$$\ell _0$$ ${\ell }_0$model has an objective function that is the sum of a convex fidelity term and a Moreau envelope of the$$\ell _0$$ ${\ell }_0$norm regularization term. Such an$$\ell _0$$ ${\ell }_0$model is non-convex. Existing exact algorithms for solving the problems require the availability of closed-form formulas for the proximity operator of convex functions involved in the objective function. When such formulas are not available, numerical computation of the proximity operator becomes inevitable. This leads to inexact iteration algorithms. We investigate in this paper how the numerical error for every step of the iteration should be controlled to ensure global convergence of the inexact algorithms. We establish a theoretical result that guarantees the sequence generated by the proposed inexact algorithm converges to a local minimizer of the optimization problem. We implement the proposed algorithms for three applications of practical importance in machine learning and image science, which include regression, classification, and image deblurring. The numerical results demonstrate the convergence of the proposed algorithm and confirm that local minimizers of the$$\ell _0$$ ${\ell }_0$models found by the proposed inexact algorithm outperform global minimizers of the corresponding$$\ell _1$$ ${\ell }_1$models, in terms of approximation accuracy and sparsity of the solutions. 

   more » « less
5. Block mapping class groups and their finiteness properties

   https://doi.org/10.1007/s10711-025-00985-9  

   Aramayona, J; Aroca, J; Cumplido, M; Skipper, R; Wu, X (April 2025, Geometriae Dedicata)

   Abstract Given$$g \in \mathbb N \cup \{0, \infty \}$$ $g\in N\cup \{0,\infty \}$, let$$\Sigma _g$$ ${\Sigma }_g$denote the closed surface of genusgwith a Cantor set removed, if$$g<\infty $$ $g<\infty$; or the blooming Cantor tree, when$$g= \infty $$ $g=\infty$. We construct a family$$\mathfrak B(H)$$ $B\left(H\right)$of subgroups of$${{\,\textrm{Map}\,}}(\Sigma _g)$$ $\text{Map}\left({\Sigma }_g\right)$whose elements preserve ablock decompositionof$$\Sigma _g$$ ${\Sigma }_g$, andeventually like actlike an element ofH, whereHis a prescribed subgroup of the mapping class group of the block. The group$$\mathfrak B(H)$$ $B\left(H\right)$surjects onto an appropriate symmetric Thompson group of Farley–Hughes; in particular, it answers positively. Our main result asserts that$$\mathfrak B(H)$$ $B\left(H\right)$is of type$$F_n$$ $F_n$if and only ifHis. As a consequence, for every$$g\in \mathbb N \cup \{0, \infty \}$$ $g\in N\cup \{0,\infty \}$and every$$n\ge 1$$ $n\ge 1$, we construct a subgroup$$G <{{\,\textrm{Map}\,}}(\Sigma _g)$$ $G<\text{Map}\left({\Sigma }_g\right)$that is of type$$F_n$$ $F_n$but not of type$$F_{n+1}$$ $F_{n+1}$, and which contains the mapping class group of every compact surface of genus$$\le g$$ $\le g$and with non-empty boundary. 

   more » « less