Related papers: Finding an Integral vector in an Unknown Polyhedra…

Let $X=\{x_i\}_{i=1}^m$ be a set of unit vectors in $\RR^n$. The coherence of $X$ is $\coh(X):=\max_{i\not=j}|\langle x_i, x_j\rangle|$. A vector $x\in X$ is said to be isolable if there are no unit vectors $x'$ arbitrarily close to $x$…

We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row. The core of our…

A Dold-Puppe complex is the image NF\Gamma(C.) of a chain complex C. under the composition of the functors \Gamma, F and N where \Gamma and N are given by the Dold-Kan correspondence and F is a not-necessarily linear functor between two…

Given a set $\Gamma$ of low-degree k-dimensional varieties in $\mathbb{R}^n$, we prove that for any $D \ge 1$, there is a non-zero polynomial $P$ of degree at most $D$ so that each component of $\mathbb{R}^n \setminus Z(P)$ intersects…

Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a…

Let $X\subseteq \mathbb{P}^m$ be a totally real, non-degenerate, projective variety and let $\Gamma\subseteq X(\mathbb{R})$ be a generic set of points. Let $P$ be the cone of nonnegative quadratic forms on $X$ and let $\Sigma$ be the cone…

We study the problem of approximating the quality of a disperser. A bipartite graph $G$ on $([N],[M])$ is a $(\rho N,(1-\delta)M)$-disperser if for any subset $S\subseteq [N]$ of size $\rho N$, the neighbor set $\Gamma(S)$ contains at least…

We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…

Let $G$ be a real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$, and $T$ be a maximal $\mathbb{R}$-split torus. A trajectory in $G/\Gamma$ is divergent if eventually it leaves every compact subset. In…

We obtain a compactness result for $\Gamma$-convergence of integral functionals defined on $\mathcal{A}$-free vector fields. This is used to study homogenization problems for these functionals without periodicity assumptions. More…

This present paper provides the absolutely necessary corrections to the previous work entitled {\it A polynomial Time Algorithm to Solve The Max-atom Problem} (arXiv:2106.08854v1). The max-atom-problem (MAP) deals with system of scalar…

We introduce an algorithm which, in the context of nonlinear regression on vector-valued explanatory variables, chooses those combinations of vector components that provide best prediction. The algorithm devotes particular attention to…

For a graph $\Gamma=(V\Gamma,E\Gamma)$, a subset $D$ of $V\Gamma$ is a perfect code in $\Gamma$ if every vertex of $\Gamma$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on…

Let $R$ be a ring with unity. The graph $\Gamma(R)$ is a graph with vertices as elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if $Ra+Rb=R$. Let $\Gamma_2(R)$ is the subgraph of $\Gamma(R)$ induced by the…

Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…

We study a generalization of the knapsack problem with geometric and vector constraints. The input is a set of rectangular items, each with an associated profit and $d$ nonnegative weights ($d$-dimensional vector), and a square knapsack.…

A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D\geq 1$. For a vertex $x$ of $\Gamma$ the corresponding subconstituent algebra $T=T(x)$ is generated by the adjacency matrix $A$ of $\Gamma$ and the dual adjacency…

The codegree of an irreducible character $\chi$ of a finite group $G$ is defined as $|G:\ker\chi|/\chi(1)$. The codegree graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertices are the prime divisors of $|G|$, where two distinct…

The equivariant coarse Novikov conjecture provides an algorithm for determining nonvanishing of equivariant higher index of elliptic differential operators on noncompact manifolds. In this article, we prove the equivariant coarse Novikov…