Related papers: Generalized star configurations and the Tutte poly…
Let S be a polynomial ring in n variables, over an arbitrary field. We give the total, graded, and multigraded Betti numbers of S/M, for every monomial ideal M in S. We also give an explicit characterization of all monomial ideals M in S…
The ranks and kernels of generalized Hadamard matrices are studied. It is proven that any generalized Hadamard matrix $H(q,\lambda)$ over $F_q$, $q>3$, or $q=3$ and $\gcd(3,\lambda)\not =1$, generates a self-orthogonal code. This result…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and…
In this paper, we introduce the framework of a generalized design, which represents any linear operator as a finite sum of local linear maps attached to finitely many points, thereby abstracting the core of design theory without employing…
The content of a polynomial $f(t)$ is the ideal generated by its coefficients. Our aim here is to consider a beautiful formula of Dedekind-Mertens on the content of the product of two polynomials, to explain some of its features from the…
We associate to each $r$-multigraded, locally finitely generated ideal in the "large polynomial ring" on countably many indeterminates a power series in $r$ variables; this power series is the limit in the adic topology of the numerators of…
We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…
This letter describes a novel derivation of general relativity by considering the (non)self-consistency of theories whose Hamiltonians are constraints. The constraints, from Hamilton's equations, generate the evolution, while the evolution,…
For a certain class of configurations of points in space, Eves' Theorem gives a ratio of products of distances that is invariant under projective transformations, generalizing the cross-ratio for four points on a line. We give a…
Can neural networks systematically capture discrete, compositional task structure despite their continuous, distributed nature? The impressive capabilities of large-scale neural networks suggest that the answer to this question is yes.…
We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…
An attempt is made to describe random matrix ensembles with unitary invariance of measure (UE) in a unified way, using a combination of Tracy-Widom (TW) and Adler-Shiota-Van Moerbeke (ASvM) approaches to derivation of partial differential…
We explicitly determine all the relative generalized Hamming weights of affine Cartesian codes using the notion of footprints and results from extremal combinatorics. This generalizes the previous works on the determination of relative…
In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
We study generalized Hermite polynomials with rectangular matrix arguments arising in multivariate statistical analysis and the theory of zonal polynomials. We show that these are well-suited for expressing the Wiener-Ito chaos expansion of…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…