English
Related papers

Related papers: Computing Algebraic Matroids

200 papers

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Computational Geometry · Computer Science 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff

For an integer $n\geq 7$, we investigate the matroid realization space of a specific deformation of the regular $n$-gon along with its lines of symmetry. It turns out that this particular realization space is birational to the elliptic…

Algebraic Geometry · Mathematics 2025-12-08 Lukas Kühne , Xavier Roulleau

The relationship between algebraic geometry and the inferential framework of the Bayesian Networks with hidden variables has now been fruitfully explored and exploited by a number of authors. More recently the algebraic formulation of…

Methodology · Statistics 2007-09-24 Eva Riccomagno , Jim Q Smith

We study a generalization of the concept of harmonic conjugation from projective geometry and full algebraic matroids to a larger class of matroids called \emph{harmonic matroids}. We use harmonic conjugation to construct a projective plane…

Combinatorics · Mathematics 2022-02-22 Rigoberto Florez

Braided non-commutative differential geometry is studied. In particular we investigate the theory of (bicovariant) differential calculi in braided abelian categories. Previous results on crossed modules and Hopf bimodules in braided…

q-alg · Mathematics 2008-02-03 Yuri Bespalov , Bernhard Drabant

An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the case analysis in the proof.

Combinatorics · Mathematics 2012-05-07 Konstantinos Papalamprou , Leonidas Pitsoulis

We give an expository review of applications of computational algebraic statistics to design and analysis of fractional factorial experiments based on our recent works. For the purpose of design, the techniques of Gr\"obner bases and…

Methodology · Statistics 2012-04-09 Satoshi Aoki , Akimichi Takemura

A signed graph has edge signs. A gain graph has oriented edge gains drawn from a group. We define the combination of the two for the abelian case, in which each oriented edge of a signed graph has a gain from an abelian group, concentrating…

Combinatorics · Mathematics 2022-06-22 Laura Anderson , Ting Su , Thomas Zaslavsky

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

Algebraic Geometry · Mathematics 2013-03-27 Natalia Dück , Karl-Heinz Zimmermann

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

Representation Theory · Mathematics 2019-06-27 Tom Halverson , Theodore N. Jacobson

It is known that any multiplication of a finite dimensional algebra is determined by a matrix of structural constants. In general, this is a cubic matrix. Difficulty of investigation of an algebra depends on the cubic matrix. Such a cubic…

Rings and Algebras · Mathematics 2019-10-10 A. N. Imomkulov , U. A. Rozikov

Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full…

Artificial Intelligence · Computer Science 2017-01-19 Manuele Leonelli , Eva Riccomagno , Jim Q. Smith

Our main contribution is a polynomial-time algorithm to reduce a $k$-colorable gammoid to a $(2k-2)$-colorable partition matroid. It is known that there are gammoids that can not be reduced to any $(2k-3)$-colorable partition matroid, so…

Data Structures and Algorithms · Computer Science 2021-07-09 Marilena Leichter , Benjamin Moseley , Kirk Pruhs

A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…

Operator Algebras · Mathematics 2007-05-23 S. C. Power

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

Symbolic Computation · Computer Science 2026-03-18 Elisabetta Rocchi , Mohab Safey El Din

In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…

Combinatorics · Mathematics 2024-07-31 Matthew Baker , Oliver Lorscheid , Tianyi Zhang

A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…

Combinatorics · Mathematics 2020-06-02 Kevin Grace , Stefan H. M. van Zwam

We study the geometry of algebraic numbers in the complex plane, and their Diophantine approximation, aided by extensive computer visualization. Motivated by these images, called algebraic starscapes, we describe the geometry of the map…

Number Theory · Mathematics 2022-07-12 Edmund Harriss , Katherine E. Stange , Steve Trettel

We construct geometric examples of N-differential graded algebras such as the algebra of differential forms of depth $N$ on an affine manifold, and $N$-flat covariant derivatives.

Differential Geometry · Mathematics 2016-08-16 Mauricio Angel , Rafael Díaz

Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…

Combinatorics · Mathematics 2011-11-10 Audrey Lee , Ileana Streinu , Louis Theran