Related papers: On Reed-Muller subcodes, Grassmannian partitions a…

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several…

A claw-free graph is a graph that does not contain $K_{1,3}$ as an induced subgraph, and a 2-factor is a 2-regular spanning subgraph of a graph. In 1997, Ryj\'{a}\v{c}ek introduced the closure concept of claw-free graphs, and Hamilton…

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$. Let $F(s)= \sum_{n=1}^\infty f(n)n^{-s}$ be the associated Dirichlet series and $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ be the truncated Dirichlet…

Let X be a finite 2-complex with unfree fundamental group. We prove lower bounds for the area of a metric on X, in terms of the square of the least length of a noncontractible loop in X. We thus establish a uniform systolic inequality for…

Fix graphs $F$ and $H$ and let $ex(n,H,F)$ denote the maximum possible number of copies of the graph $H$ in an $n$-vertex $F$-free graph. The systematic study of this function was initiated by Alon and Shikhelman [{\it J. Comb. Theory, B}.…

Preparing the Fr\'echet-Grassmann (FG-)algebra ${\fR}$ composed with countably infinite Grassmann generators, we introduce the superspace ${\fR}^{m|n}$. After defining Grassmann continuation of smooth functions on ${\euc}^m$ to those on…

The Dirichlet--Hardy space $\Ht$ consists of those Dirichlet series $\sum_n a_n n^{-s}$ for which $\sum_n |a_n|^2<\infty$. It is shown that the Blaschke condition in the half-plane $\operatorname{Re} s>1/2$ is a necessary and sufficient…

Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…

Let $d \geq 1$ be an integer and $\mathcal{K}_{d}$ be a contravariant functor from the category of subgroups of $(\mathbb{Z}/2\mathbb{Z})^{d}$ to the category of graded and finite $\mathbb{F}_{2}$-algebras. In this paper, we generalize the…

Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer $q$ power of a prime and any integer $n$ there is a family of MRD-codes of length $n$ over $\FF{q^n}$ having polynomial-time…

For $A\subseteq \mathbb{R}$, let $A+A=\{a+b: a,b\in A\}$ and $AA=\{ab: a,b\in A\}$. For $k\in \mathbb{N}$, let $SP(k)$ denote the minimum value of $\max\{|A+A|, |AA|\}$ over all $A\subseteq \mathbb{N}$ with $|A|=k$. Here we establish…

Let $ m, n $ be integers such that $ \frac{n}{2} > m \geq 1 $ and let $ (M, g) $ be a closed $ n-$dimensional Riemannian manifold. We prove there exists some $ B \in \mathbb{R} $ depending only on $ (M, g) $, $ m $, and $ n $ such that for…

A collection of $k$ sets is said to form a $k$-sunflower, or $\Delta$-system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal{F}$ sunflower-free if it contains no sunflowers.…

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Let ${\mathfrak M}=({\mathcal M},\rho)$ be a metric space and let $X$ be a Banach space. Let $F$ be a set-valued mapping from ${\mathcal M}$ into the family ${\mathcal K}_m(X)$ of all compact convex subsets of $X$ of dimension at most $m$.…

We prove that if $A_1, A_2, \dots, A_n$ are tracial abelian von Neumann algebras for $2\leq n \leq \infty$ and $M = A_1 * \cdots * A_n$ is their free product, then any subalgebra $A \subset M$ of the form $A = \sum_{i=1}^n u_i A_i p_i…

This note is purely expository. In the course of the Kolmogorov-Arnold solution of Hilbert's 13th problem on superpositions there appeared the notion of basic embedding. A subset K of R^2 is basic if for each continuous function f:K->R…