Related papers: On the size of a linear combination of two linear …

Let $(M^{n+1},g)$ be a closed Riemannian manifold, $n+1\geq 3$. We will prove that for all $m \in \mathbb{N}$, there exists $c^{*}(m)>0$, which depends on $g$, such that if $0<c<c^{*}(m)$, $(M,g)$ contains at least $m$ many closed $c$-CMC…

Let ||.|| be a norm on the algebra M_n of all n-by-n matrices over the complex field C. An interesting problem in matrix theory is that "are there two norms ||.||_1 and ||.||_2 on C^n such that ||A||=max{||Ax||_2: ||x||_1=1} for all A in…

Consider a system of $m$ balanced linear equations in $k$ variables with coefficients in $\mathbb{F}_q$. If $k \geq 2m + 1$, then a routine application of the slice rank method shows that there are constants $\beta,\gamma \geq 1$ with…

Let G be one of the groups SL_n C, Sp_2n C, SO_m C, O_m C, or G_2. For a generically free G-representation V, we say that N is a level of stable rationality for V/G if V/G x P^N is rational. In this paper we improve known bounds for the…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

HMC sets are hereditarily at most countable sets. We rework a substantial part of univariate real analysis in a form in which only HMC real functions are used. In such countable real analysis we carry out Hilbert's proof of transcendence of…

Using the $\mathbb{R}((X))$-measure, we define and study certain $\mathbb{C}((X))$-valued functions on $\mathrm{GL}_n(F)$ for $F$ a two-dimensional local field. In particular, we define a convolution product on such suitable functions,…

Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear…

Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

In this paper we assemble some results about the upper-semicontinuity and lower-semicontinuity of the feasible correspondence and the solution correspondence of linear programming problems allowing variability of all parameters of such…

We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…

For many common height functions, it is notoriously hard to compute the essential minimum. Nevertheless there are two classical methods, one giving lower bounds and the other giving upper bounds. In this paper, we show that the two methods…

Let $\mathcal{H}$ be a complex Hilbert space and $T:\mathcal{H}\to \mathcal{H}$ be a contraction. Let $$A_nf=\frac{1}{n}\sum_{j=1}^nT^jf$$ for $f\in \mathcal{H}$. Let $(n_k)$ be a lacunary sequence, then there exists a constant $C_1>0$ such…

We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of…

Let $k$ be a positive integer and $G$ be a finite group that cannot be written as the union of $k$ proper subgroups. In this short note, we study the existence of a constant $c_k\in (0,1)$ such that $|\cup_{i=1}^k H_i| \leq c_k|G|$, for all…

Given a finite-dimensional faithful representation $V$ of a linearly reductive group $G$ over a field $K=\bar K$, we consider the growth of the number of irreducible factors of $V^{\otimes n}$ when $n$ is large. We prove that there exist…

In this paper, we study the eigenvalues of the GCD matrix $(S_n)$ and the LCM matrix $[S_n]$ defined on $S_n=\{1,2,\ldots,n\}$. We present upper and lower bounds for the smallest and the largest eigenvalues of $(S_n)$ and $[S_n]$ in terms…

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater…