相关论文: From coordinate subspaces over finite fields to id…

We study the "q-commutative" power series ring R:=k_q[[x_1,...,x_n]], defined by the relations x_ix_j = q_{ij}x_j x_i, for multiplicatively antisymmetric scalars q_{ij} in a field k. Our results provide a detailed account of prime ideal…

Distribution networks with periodically repeating events often hold great promise to exploit economies of scale. Joint replenishment problems are a fundamental model in inventory management, manufacturing, and logistics that capture these…

In this paper, we consider certain topological properties along with certain types of mappings on these spaces defined by the notion of ideal convergence. In order to do that, we primarily follow in the footsteps of the earlier studies of…

In the general submatrix detection problem, the task is to detect the presence of a small $k \times k$ submatrix with entries sampled from a distribution $\mathcal{P}$ in an $n \times n$ matrix of samples from $\mathcal{Q}$. This…

We define a notion of ideal for objects in the category of abstract unitary Cuntz semigroups introduced in [3] and termed Cu$^\sim$. We show that the set of ideals of a Cu$^\sim$-semigroup has a complete lattice structure. In fact, we prove…

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak…

We explain the physical origin of a curious property of algebras $\mathcal{A}_\mathfrak{q}$ which encode the rotation-equivariant fusion ring of half-BPS line defects in four-dimensional $\mathcal{N}=2$ supersymmetric quantum field…

A coloring of the $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called…

For a set $\cM=\{-\mu,-\mu+1,\ldots, \lambda\}\setminus\{0\}$ with non-negative integers $\lambda,\mu<q$ not both 0, a subset $\cS$ of the residue class ring $\Z_q$ modulo an integer $q\ge 1$ is called a $(\lambda,\mu;q)$-\emph{covering…

In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…

Let $G$ be a $(C_4, 2K_2)$-free graph with edge ideal $I(G)\subset \Bbbk[x_1,\dots , x_n]$. We show that $I(G)^s$ has linear resolution for every $s\geq 2$. Also, we show that every power of the vertex cover ideal of $G$ has linear…

The power classes of a field are well-known for their ability to parameterize elementary $p$-abelian Galois extensions. These classical objects have recently been reexamined through the lens of their Galois module structure. Module…

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…