Related papers: The Circuit Ideal of a Vector Configuration

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

We show that every proper, dense ideal in a C*-algebra is contained in a prime ideal. It follows that a subset generates a C*-algebra as a not necessarily closed ideal if and only if it is not contained in any prime ideal. This allows us to…

We prove that for any toric ideal of a graph the degree of any element of Graver basis is bounded above by an exponential function of the maximal degree of a circuit.

For a simple graph $G$, let $J_G$ denote the corresponding binomial edge ideal. This article considers the binomial edge ideal of the corona product of two connected graphs $G$ and $H$. The corona product of $G$ and $H$, denoted by $G\circ…

We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key…

A C*-algebra $A$ is said to be stable if it is isomorphic to $A \otimes K(\ell_2)$. Hjelmborg and R\o rdam have shown that countable inductive limits of separable stable C*-algebras are stable. We show that this is no longer true in the…

The combinatorial integral approximation (CIA) is a solution technique for integer optimal control problems. In order to regularize the solutions produced by CIA, one can minimize switching costs in one of its algorithmic steps. This leads…

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

Let $ V $ a vector space of dimension $n$. A family $ \{H_1, \ldots, H_p \} $ of vectorial hyperplans $V$ defines an arrangement $ {\cal A} $ of $ V $. For $ i \in \{ 1, \ldots, p \} $, let $ l_i $ be a linear form on $V$ with $H_i$ as…

Fractional Interference Alignment (FIA) is a transmission scheme which achieves any value between [0,1] for the Symbols transmitted per Antenna per Channel use (SpAC). FIA was designed in [1] specifically for Finite Alphabet (FA) signals,…

A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be…

Over a field of characteristic zero, we prove that for each r, there exists a constant C(r) so that the prime ideal of the rth secant variety of any Veronese embedding of any projective space is generated by polynomials of degree at most…

Given $\Sigma\subset\mathbb K[x_1,\ldots,x_k]$, any finite collection of linear forms, some possibly proportional, and any $1\leq a\leq |\Sigma|$, it has been conjectured that $I_a(\Sigma)$, the ideal generated by all $a$-fold products of…

We describe primitive and prime ideals in the C*-algebra C*(E) of a graph E satisfying Condition (K), together with the topologies on each of these spaces. In particular, we find that primitive ideals correspond to the set of maximal tails…

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

We describe the prime ideals and, in particular, the maximal ideals in products $R = \prod D_\lambda$ of families $(D_\lambda)_{\lambda \in \Lambda}$ of commutative rings. We show that every maximal ideal is induced by an ultrafilter on the…

Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…

In this paper we provide characterizing properties of TDI systems, among others the following: a system of linear inequalities is TDI if and only if its coefficient vectors form a Hilbert basis, and there exists a test-set for the system's…

Arithmetic circuits are a natural well-studied model for computing multivariate polynomials over a field. In this paper, we study planar arithmetic circuits. These are circuits whose underlying graph is planar. In particular, we prove an…

Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely…