Related papers: Total dual dyadicness and dyadic generating sets

Dominating set problems are among the most important class of combinatorial problems in graph optimization, from a theoretical as well as from a practical point of view. In this paper, we address the recently introduced (minimum) weighted…

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in…

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The \emph{Efficient Domination} (ED) problem, which…

Let $\AAutH (X)$ be the subgroup of the group $\AutH (X)$ of holomorphic automorphisms of a normal affine algebraic surface $X$ generated by elements of flows associated with complete algebraic vector fields. Our main result is a…

A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we…

We extend the notion of a dyadic grid of cubes in Euclidean space to include infinite dyadic cubes. These `tops' of a dyadic grid form a tiling of Euclidean space which is subject to the constraints similar to those arising in tiling…

We construct a new type of convergent asymptotic representations, dyadic factorial expansions. Their convergence is geometric and the region of convergence can include Stokes rays, and often extends down to 0^+. For special functions such…

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…

Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…

In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different graph classes. For 1-planar graphs,…

For a field $F$ and an integer $d\geq 1$, we consider the universal associative $F$-algebra $A$ generated by two sets of $d+1$ mutually orthogonal idempotents. We display four bases for the $F$-vector space $A$ that we find attractive. We…

Let $\sg_i$, $i=1,\ldots,n$, denote reverse doubling weights on $\R^d$, let $\cdr(\R^d)$ denote the set of all dyadic rectangles on $\R^d$ (Cartesian products of usual dyadic intervals) and let $K:\,\cdr(\R^d)\to[0,\8)$ be a~map. In this…

Let $k$ be a field of characteristic zero, and $R=k[x_1, \ldots, x_d]$ with $d \geq 3$ be a polynomial ring in $d$ variables. Let $\m=(x_1, \ldots, x_d)$ be the homogeneous maximal ideal of $R$. Let $\mathcal{K}$ be the kernel of the…

Given a graph $G=(V,E)$ of order $n$ and an $n$-dimensional non-negative vector $d=(d(1),d(2),\ldots,d(n))$, called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum $S\subseteq V$…

Let $\mathbb{K}$ be a number field of degree $k$ and let $\mathcal{O}$ be an order in $\mathbb{K}$. A \emph{generalized number system over $\mathcal{O}$} (GNS for short) is a pair $(p,\mathcal{D})$ where $p \in \mathcal{O}[x]$ is monic and…

Let F be a finite field and R = M2(F) be 2x2 matrix ring over F. In this paper, we explicitly determine all the idempotents in R. Using these idempotents, we study the idempotent graph of R whose vertex set is the set of non-trivial…

In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of parameters for the coordinate rings of these two sets and their…

We consider the family of piecewise linear maps $F(x,y)=\left(|x| - y + a, x - |y| + b\right),$ where $(a,b)\in \R^2$. In previous work, we identified a novel phenomenon: certain maps of this class possess one-dimensional invariant sets,…

We prove two results about the derived functor of $a$-adic completion: (1) Let $K$ be a commutative noetherian ring, let $A$ be a flat noetherian $K$-algebra which is $a$-adically complete with respect to some ideal $a\subseteq A$, such…