Related papers: Algorithms for Checking Zero-Dimensional Complete …

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a…

The tilting correspondence is a fundamental property of perfectoid fields. In this note, we show that the tilting construction can also be used to detect perfectoid fields among nonarchimedean fields. In particular, for $K$ a complete…

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and…

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…

We study finite $0$-dimensional schemes in product of multiprojective spaces and their ideals. In particular, we describe the set of generators of the ideal defining a $0$-dimensional scheme in the case $\mathbb P^{1}\times\cdots…

Let $A$ be a finite-dimensional associative $k$-algebra with identity. The primary aim of this paper is to study the rationality properties of the group of all $k$-algebra automorphisms of $A$, as an affine algebraic group over an arbitrary…

We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…

Let $(A,\mathfrak{m})$ be an abstract complete intersection and let $P$ be a prime ideal of $A$. In [1] Avramov proved that $A_P$ is an abstract complete intersection. In this paper we give an elementary proof of this result.

We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Let $A(x)=A\_0+x\_1A\_1+...+x\_nA\_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A\_0,A\_1,...,A\_n$ of size $m$ with rational entries. The set of real vectors x such that the pencil is positive semidefinite is a…

We study ideals in a local ring $R$ whose quotient rings induce large homomorphisms of local rings. We characterize such ideals over complete intersections, Koszul rings, and over some classes of Golod rings.

In this paper we investigate the Rees algebras of squarefree monomial ideals $I \subset S=K[x_1,\dots,x_n]$ generated in degree $n-2$, where $K$ is a field. Every such ideal arises as the complementary edge ideal $I_c(G)$ of a finite simple…

Let k be a perfect field of characteristic p>0, let A_d be the coordinate ring of the coordinate axes in affine d-space over k, and let I_d be the ideal defining the origin. We evaluate the relative K-groups K_q(A_d,I_d) in terms of…

Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…

This paper develops an optimal acceleration/speed profile for a single autonomous vehicle crossing multiple signalized intersections without stopping in free flow mode. The design objective is to produce both time and energy efficient…

Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…