Related papers: A commutative algebraic approach to the fitting pr…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Let $\Gamma'<\Gamma$ be two discrete groups acting properly by isometries on a Gromov-hyperbolic space $X$. We prove that their critical exponents coincide if and only if $\Gamma'$ is co-amenable in $\Gamma$, under the assumption that the…
There is the problem, whether for a given virtually torsionfree discrete group $\Gamma$ there exists a cocompact proper topological $\Gamma$-manifold, which is equivariantly homotopy equivalent to the classifying space for proper actions.…
Let $1\leq p\leq n$ be two positive integers. For a linearly nondegenerate holomorphic mapping $f\colon\mathbb{C}^p\rightarrow\mathbb{P}^n(\mathbb{C})$ of maximal rank intersecting a family of hyperplanes in general position, we obtain a…
Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a…
The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…
Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…
The $n$-th Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by binary strings with no two consecutive ones. We determine $\pi(\Gamma_n) = 2^n$ for $n \le 6$, so the pebbling number of $\Gamma_n$ equals that of the…
Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…
Given a graph $G$ with a total order defined on its vertices, the Maximum Pagenumber-$k$ Subgraph Problem asks for a maximum subgraph $G'$ of $G$ such that $G'$ can be embedded into a $k$-book when the vertices are placed on the spine…
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…
Let $\Gamma$ be a torsion-free hyperbolic group. We study $\Gamma$--limit groups which, unlike the fundamental case in which $\Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $\Gamma$--limit…
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…
Given an ideal $I$, the containment problem is concerned about finding the values $m$ and $n$ such that the $m$-th symbolic power of $I$ is contained in its $n$-th ordinary power. In this paper we consider this problem focusing on two…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
An inverse problem of elasticity of $n$ elastic inclusions embedded into an elastic half-plane is analyzed. The boundary of the half-plane is free of traction. The half-plane and the inclusions are subjected to antiplane shear, and the…
We consider time-harmonic acoustic scattering by a compact sound-soft obstacle $\Gamma\subset \mathbb{R}^n$ ($n\geq 2$) that has connected complement $\Omega := \mathbb{R}^n\setminus \Gamma$. This scattering problem is modelled by the…
We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…