Related papers: Computing Algebraic Matroids
The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
A toric variety is constructed from a lattice polytope. It is common in algebraic combinatorics to carry this way a notion of an algebraic property from the variety to the polytope. From the combinatorial point of view, one of the most…
In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
We develop a new algorithm to compute a basis for $M_k(\Gamma_0(N))$, the space of weight $k$ holomorphic modular forms on $\Gamma_0(N)$, in the case when the graded algebra of modular forms over $\Gamma_0(N)$ is generated at weight two.…
In this paper, we use elementary method to give a classification of the multiplicative maps on matrix algebra $M_{n}(\mF)$ over a field $\mF$ of characteristic $0$. All the multiplicative maps are classified into three classes: the trivial…
This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…
We compute the motivic homotopy groups of algebraic cobordism over number fields, the motivic homotopy groups of 2-complete algebraic cobordism over the real numbers and rings of $2$-integers and the motivic homotopy groups of mod 2 motivic…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
We investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces. We prove a structure theorem for morphisms from the affine line into the moduli…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
The underlying algebra for a noncommutative geometry is taken to be a matrix algebra, and the set of derivatives the adjoint of a subset of traceless matrices. This is sufficient to calculate the dual 1-forms, and show that the space of…
This expository paper reviews some of the recent uses of computational algebraic geometry in classical and quantum optimization. The paper assumes an elementary background in algebraic geometry and adiabatic quantum computing (AQC), and…
We combine some known results and techniques with new ones to show that there exists a non-algebraic, multi-linear matroid. This answers an open question by Matus (Discrete Mathematics 1999), and an open question by Pendavingh and van Zwam…
The graded M\"{o}bius algebra of a matroid is a commutative graded algebra which encodes the combinatorics of the lattice of flats of the matroid. As a special subalgebra of the augmented Chow ring of the matroid, it plays an important role…