Related papers: A note on the Bilinear Bogolyubov Theorem: Transve…

A planar polygonal billiard $\P$ is said to have the finite blocking property if for every pair $(O,A)$ of points in $\P$ there exists a finite number of ``blocking'' points $B_1, ..., B_n$ such that every billiard trajectory from $O$ to…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

We demonstrate that a system of bi-orthogonal polynomials and their associated functions corresponding to a regular semi-classical weight on the unit circle constitute a class of general classical solutions to the Garnier systems by…

The problem of decomposition of bilinear forms which satisfy a certain condition has been studied by many authors by example in \cite{H08}: Let $H$ and $K$ be Hilbert spaces and let $A,C \in B(H),B,D\in B(K)$. Assume that $u:H\times Karrow…

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…

Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…

Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…

A nonlinear generalization of convergence sets of formal power series, in the sense of Abhyankar-Moh, is introduced. Given a family y=\phi_{s}(t,x)=sb_{1}(x)t+b_{2}(x)t^{2}+... of analytic curves in C\timesC^{n} passing through the origin,…

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…

The so-called Fundamental Theorem of Dynamical Systems -- which(1) relates attractors and repellers to the chain recurrent set and (2) gives the existence of a complete Lyapunov function -- can be seen as a means of separating out…

A planar node set $\mathcal X,$ with $\#\mathcal X=\binom{n+2}{2},$ is called $GC_n$ set if each node possesses fundamental polynomial in form of a product of $n$ linear factors. We say that a node uses a line if the line is a factor of the…

The orthogonal groups are a series of simple Lie groups associated to symmetric bilinear forms. There is no analogous series associated to symmetric trilinear forms. We introduce an infinite dimensional group-like object that can be viewed…

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…

A family of sets $\mathcal{A}$ is union-closed if it is finite and nonempty with member sets that are all finite and distinct (at least one of which is nonempty) and it satisfies the property $X, Y \in \mathcal{A} \implies X \cup Y \in…