Related papers: Elliptic arrangements of complex multiplication ty…

The configuration of a matroid $M$ is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of $M$, and stronger…

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

We define elliptic sequences over a commutative ring as sequences indexed by the (positive) integers satisfying a 4-parameter, highly symmetric family of homogeneous quartic relations among terms which we call elliptic relations. We…

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

Let $E$ be an elliptic curve defined over $\mathbf{Q}$ without complex multiplication. For each prime $\ell$, there is a representation $\rho_{E,\ell}\colon \text{Gal}(\overline{\mathbf{Q}}/\mathbf{Q}) \to \text{GL}_2(\mathbf{F}_{\ell})$…

In this work, we study matroids over a domain and several classical combinatorial and algebraic invariants related. We define their Grothendieck-Tutte polynomial $T_{\mathcal{M}}(x,y)$, extending the definition given by Fink and Moci in…

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…

Consider the elliptic curve $E$ given by the Weierstrass equation $y^2 = x^3 - 11x - 14$, which has complex multiplication by the order of conductor $2$ inside $\mathbb{Z}[i]$. It was recently observed in a paper of Daniels and…

The homotopy type of the complement manifold of a complexified toric arrangement has been investigated by d'Antonio and Delucchi in a paper that shows the minimality of such topological space. In this work we associate to a given toric…

Explicit expressions for multimatrix models with complex and unitary matrices allows to couple these models with well-known unitary, orthogonsl and sympletic ensembles. We consider examples of such mixed ensembles which are solvable in the…

Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…

Let $p$ be a prime and let $K$ be a finite extension of $\mathbb{Q}_p$. Let $E/K$ be an elliptic curve with additive reduction. In this paper, we study the topological group structure of the set of points of good reduction of $E(K)$. In…

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first…

We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…

Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…

We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…