Related papers: On the regularity index of the minimum distance fu…

We present a new method for minimizing the sum of a differentiable convex function and an $\ell_1$-norm regularizer. The main features of the new method include: $(i)$ an evolving set of indices corresponding to variables that are predicted…

The clique removal lemma says that for every $r \geq 3$ and $\varepsilon>0$, there exists some $\delta>0$ so that every $n$-vertex graph $G$ with fewer than $\delta n^r$ copies of $K_r$ can be made $K_r$-free by removing at most…

The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…

We provide an explicit algorithm to compute a Massey triple product relative to a defining system for a smooth projective plane curve $X$ defined by a homogeneous polynomial $G(\underline x)$ over a field. The main idea is to use the…

For any minimal system $(X,T)$ and $d\geq 1$ there is an associated minimal system $(N_{d}(X), \mathcal{G}_{d}(T))$, where $\mathcal{G}_{d}(T)$ is the group generated by $T\times\cdots\times T$ and $T\times T^2\times\cdots\times T^{d}$ and…

Regarding the generating structure of the homogeneous ideal of a projective variety $X \subset \mathbb{P}^r$, we define the rank index of $X$ to be the smallest integer $k$ such that $I(X)$ can be generated by quadratic polynomials of rank…

Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain…

We investigate the following mixed local and nonlocal quasilinear equation with singularity given by \begin{eqnarray*} \begin{split} -\Delta_pu+(-\Delta)_q^s u&=\frac{f(x)}{u^{\delta}}\text { in } \Omega, \\u&>0 \text{ in } \Omega,\\u&=0…

In this paper, moderate deviations for normal approximation of functionals over infinitely many Rademacher random variables are derived. They are based on a bound for the Kolmogorov distance between a general Rademacher functional and a…

Let $G$ be a connected graph. The resistance distance between any two vertices of $G$ is equal to the effective resistance between them in the corresponding electrical network constructed from $G$ by replacing each edge with a unit…

In this paper, we propose a distributed algorithm to solve planar minimum time multi-vehicle rendezvous problem with non-identical velocity constraints on cyclic digraph (topology). Motivated by the cyclic alternating projection method that…

We continue to consider the discrete decreasing minimization problem on an integral base-polyhedron treated in Part I. The problem is to find a lexicographically minimal integral vector in an integral base-polyhedron, where the components…

We consider the problem of realizable interval-sequences. An interval sequence comprises of $n$ integer intervals $[a_i,b_i]$ such that $0\leq a_i \leq b_i \leq n-1$, and is said to be graphic/realizable if there exists a graph with degree…

Primal-dual splitting involving proximity operators in order to be able to find some approximation to the minimizer for a general form of Tikhonov type functional is in the focus of this work. This approximation is produced by a pair of…

Let $\mathbb{F}_q$ be a finite field, let $\mathbb{X}$ be a subset of a projective space ${\mathbb P}^{s-1}$, over the field $\mathbb{F}_q$, parameterized by rational functions, and let $I(\mathbb{X})$ be the vanishing ideal of…

The finite Dirichlet series from the title are defined by the condition that they vanish at as many initial zeroes of the zeta function as possible. It turned out that such series can produce extremely good approximations to the values of…

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. The co-normal product $G\star…

Consider a graph $G=(V,E)$ without isolated edges and with maximum degree $\Delta$. Given a colouring $c:E\to\{1,2,\ldots,k\}$, the weighted degree of a vertex $v\in V$ is the sum of its incident colours, i.e., $\sum_{e\ni v}c(e)$. For any…

In the context of regularized loss minimization with polyhedral gauges, we show that for a broad class of loss functions (possibly non-smooth and non-convex) and under a simple geometric condition on the input data it is possible to…

At each iteration of a Block Coordinate Descent method one minimizes an approximation of the objective function with respect to a generally small set of variables subject to constraints in which these variables are involved. The…