Related papers: On a question of Schmidt and Summerer concerning $…
In this thesis we study three problems. The first is the superposition of the operators and their proprities, such as boundedness,continuity,regularity and the inequalities of the norms of the composition of functions in some functional…
Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…
P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural…
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with $e^{O(\sqrt {log log n})}$ colors such that the edges spanned by every set of five vertices receive at least three distinct colors. This answers the first…
Consider the Schr\"odinger--Bopp--Podolsky system \[ \begin{cases} -\epsilon^2\Delta u+(V+K\phi)u=u|u|^{p-1};\newline \Delta^2\phi-\Delta\phi=4\pi K u^2 \end{cases} ~\text{in}~\mathbb{R}^3 \] for sufficiently small $\epsilon>0$, where…
In this article we study the existence of solutions to the system \begin{equation*}\left\{ \begin{array}{ll} -\left(a+b\int_{\Omega}|\nabla u|^{2}\right)\Delta u +\phi u= f(x, u) &\text{in }\Omega \hbox{} -\Delta \phi= u^{2} &\text{in…
In this paper, we will construct an example of a closed Riemann surface $X$ that can be realized as a quotient of a triply periodic polyhedral surface $\Pi \subset \mathbb{R}^3$ where the Weierstrass points of $X$ coincide with the vertices…
Separable codes were introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let $\mathcal{C}$ be a code of length $n$ over an alphabet of $q$ letters. The descendant code ${\sf…
We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…
The aim of this paper is twofold. First, three theoretical principles are formalized: randomization, overrepresentation and restriction. We develop these principles and give a rationale for their use in choosing the sampling design in a…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
We construct power series invariants of rational homology 3-spheres from quantum PSU(n)-invariants. The power series can be regarded as perturbative invariants corresponding to the contribution of the trivial connection in the hypothetical…
We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…
One of the many theorems Freiman proved, in the second half of the twentieth century, in the subject which later came to be known as "structure theory of set addition", was 'Freiman's $3k-4$ theorem' for subsets of $\Z$. In this article we…
We prove that commutative graph homology in genus $g=1$ with $n\geq 3$ markings has a direct sum decomposition whose summands have rank given by Stirling numbers of the first kind. These summands are computed as the homology of complexes of…
Define (*) There exists $(\phi_n:\omega_1\to \omega_1:n<\omega)$ such that for every uncountable $I$ which is a subset of $\omega_1$ there exists $n$ such that $\phi_n$ maps $I$ onto $\omega_1$. This is roughly what Sierpinski in his book…
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…