A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

Given a Tychonoff space $X$ and an infinite cardinal $\kappa$, we prove that exponential $\kappa$-domination in $X$ is equivalent to exponential $\kappa$-cofinality of $C_p\left(X\right)$. On the other hand, exponential $\kappa$-cofinality of $X$ is equivalent to exponential $\kappa$-domination in $C_p\left(X\right)$. We show that every exponentially $\kappa$-cofinal space $X$ has a ${\kappa }^{+}$-small diagonal; besides, if $X$ is $\kappa$-stable, then $nw\left(X\right)\le \kappa$. In particular, any compact exponentially $\kappa$-cofinal space has weight not exceeding $\kappa$. We also establish that any exponentially $\kappa$-cofinal...

We investigate the recovery of $k$-sparse signals using the ${\ell }_1$-${\ell }_2$ minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume $k$-sparse signals $𝐱$ with the prior support $T$ which is composed of $g$ true indices and $b$ wrong...

Let $\left[t\right]$ be the integral part of a real number $t$, and let $f$ be the arithmetic function satisfying some simple condition. We establish a new asymptotical formula for the sum $S_f\left(x\right)={\sum }_{n\le x}f\left([x/n]\right)$, which improves the recent result of J. Stucky (2022).

In a Tychonoff space $X$, the point $p\in X$ is called a $C^{*}$-point if every real-valued continuous function on $C\setminus \left\{p\right\}$ can be extended continuously to $p$. Every point in an extremally disconnected space is a $C^{*}$-point. A classic example is the space ${𝐖}^{*}={\omega }_1+1$ consisting of the countable ordinals together with ${\omega }_1$. The point ${\omega }_1$ is known to be a $C^{*}$-point as well as a $P$-point. We supply a characterization of $C^{*}$-points in totally ordered spaces. The remainder of our time is aimed at studying when a point in a product space...

Let ${ℱ}_h^i(k,n)$ be the $i$-th ordered configuration space of all distinct points $H_1,...,H_h$ in the Grassmannian $Gr(k,n)$ of $k$-dimensional subspaces of ${ℂ}^n$, whose sum is a subspace of dimension $i$. We prove that ${ℱ}_h^i(k,n)$ is (when non empty) a complex submanifold of $Gr{(k,n)}^h$ of dimension $i(n-i)+hk(i-k)$ and its fundamental group is trivial if $i=min(n,hk)$, $hk\ne n$ and $n\>2$ and equal to the braid group of the sphere $ℂ$ $P^1$ if $n=2$. Eventually we compute the fundamental group in the special case of hyperplane arrangements, i.e. $k=n-1$.

Let $k\ge 2$ and let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence defined by $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}$$ for $n\ge 2$ with initial conditions $$P_{-(k-2)}^{\left(k\right)}=P_{-(k-3)}^{\left(k\right)}=\cdots =P_{-1}^{\left(k\right)}=P_0^{\left(k\right)}=0,P_1^{\left(k\right)}=1.$$ In this study, we handle the equation $P_n^{\left(k\right)}=y^m$ in positive integers $n$, $m$, $y$, $k$ such that $k,y\ge 2,$ and give an upper bound on $n.$ Also, we will show that the equation $P_n^{\left(k\right)}=y^m$ with $2\le y\le 1000$ has only one solution given by $P_7^{\left(2\right)}={13}^2.$

Let $m$ and $n$ be positive integers, and let $R=(r_1,...,r_m)$ and $S=(s_1,...,s_n)$ be nonnegative integral vectors. Let $A(R,S)$ be the set of all $m\times n$ $(0,1)$-matrices with row sum vector $R$ and column vector $S$. Let $R$ and $S$ be nonincreasing, and let $F\left(R\right)$ be the $m\times n$ $(0,1)$-matrix, where for each $i$, the $i$th row of $F(R,S)$ consists of $r_i$ 1’s followed by $(n-r_i)$ 0’s. Let $A\in A(R,S)$. The discrepancy of A, $\mathrm{disc}\left(A\right)$, is the number of positions in which $F\left(R\right)$ has a 1 and $A$ has a 0. In this paper we investigate linear operators mapping $m\times n$ matrices over...

We consider $N$, the number of solutions $(x,y,u,v)$ to the equation ${(-1)}^{u}r{a}^x+{(-1)}^{v}s{b}^y=c$ in nonnegative integers $x,y$ and integers $u,v\in \{0,1\}$, for given integers $a\>1$, $b\>1$, $c\>0$, $r\>0$ and $s\>0$. When $gcd(ra,sb)=1$, we show that $N\le 3$ except for a finite number of cases all of which satisfy $max(a,b,r,s,x,y)\<2·{10}^{15}$ for each solution; when $gcd(a,b)\>1$, we show that $N\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving $N=3$ solutions.

For $X,Y\in {𝐌}_{n,m}$ it is said that $X$ is gut-majorized by $Y$, and we write $X{\prec }_{\mathrm{gut}}Y$, if there exists an $n$-by-$n$ upper triangular g-row stochastic matrix $R$ such that $X=RY$. Define the relation ${\sim }_{\mathrm{gut}}$ as follows. $X{\sim }_{\mathrm{gut}}Y$ if $X$ is gut-majorized by $Y$ and $Y$ is gut-majorized by $X$. The (strong) linear preservers of ${\prec }_{\mathrm{gut}}$ on ${ℝ}^n$ and strong linear preservers of this relation on ${𝐌}_{n,m}$ have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ${\sim }_{\mathrm{gut}}$ on ${ℝ}^n$ and ${𝐌}_{n,m}$.

In set theory without the axiom of choice ($\mathrm{AC}$), we study certain non-constructive properties of infinite-dimensional vector spaces. Among several results, we establish the following: (i) None of the principles AC${}^{\mathrm{LO}}$ (AC for linearly ordered families of nonempty sets)—and hence AC${}^{\mathrm{WO}}$ (AC for well-ordered families of nonempty sets)— $\mathrm{DC}(<\kappa )$ (where $\kappa$ is an uncountable regular cardinal), and “for every infinite set $X$, there is a bijection $f:X\to \{0,1\}\times X$”, implies the statement “there exists a field $F$ such that...

We consider $k$-free numbers over Beatty sequences. New results are given. In particular, for a fixed irrational number $\alpha >1$ of finite type $\tau <\infty$ and any constant $\epsilon >0$, we can show that $$\sum _{\genfrac{}{}{0pt}{}{1\le n\le x}{[\alpha n+\beta ]\in {𝒬}_k}}1-\frac{x}{\zeta \left(k\right)}\ll x^{k/(2k-1)+\epsilon }+x^{1-1/(\tau +1)+\epsilon },$$ where ${𝒬}_k$ is the set of positive $k$-free integers and the implied constant depends only on $\alpha ,$ $\epsilon ,$ $k$ and $\beta .$ This improves previous results. The main new ingredient of our idea is employing double exponential sums of the type $$\sum _{1\le h\le H}\sum _{\genfrac{}{}{0pt}{}{1\le n\le x}{n\in {𝒬}_k}}e\left(\vartheta hn\right).$$