English
Related papers

Related papers: Characterizing completely regular codes from an al…

200 papers

We consider generalized $\Lambda$-structures on algebras and schemes over the ring of integers $\mathit{O}_K$ of a number field $K$. When $K=\mathbb{Q}$, these agree with the $\lambda$-ring structures of algebraic K-theory. We then study…

Number Theory · Mathematics 2018-09-10 James Borger , Bart de Smit

Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory,…

Discrete Mathematics · Computer Science 2016-10-26 Chong Shangguan , Gennian Ge

We introduce the notion of logarithmically concave (or log-concave) sequences in Coding Theory. A sequence $a_0, a_1, \dots, a_n$ of real numbers is called log-concave if $a_i^2 \ge a_{i-1}a_{i+1}$ for all $1 \le i \le n-1$. A natural…

Information Theory · Computer Science 2024-10-08 Minjia Shi , Xuan Wang , Junmin An , Jon-Lark Kim

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

Combinatorics · Mathematics 2020-11-26 Ben Green , Terence Tao

Boij-S\"oderberg theory characterizes syzygies of graded modules and sheaves on projective space. This paper continues earlier work with S. Sam, extending the theory to the setting of $GL_k$-equivariant modules and sheaves on Grassmannians.…

Algebraic Geometry · Mathematics 2019-02-20 Nic Ford , Jake Levinson

Classical harmonic analysis says that the spaces of homogeneous harmonic polynomials (solutions of Laplace equation) are irreducible modules of the corresponding orthogonal Lie group (algebra) and the whole polynomial algebra is a free…

Representation Theory · Mathematics 2012-02-09 Cuiling Luo , Xiaoping Xu

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…

Chaotic Dynamics · Physics 2007-05-23 Prot Pakonski , Gregor Tanner , Karol Zyczkowski

The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by taking graph complements, it becomes…

Combinatorics · Mathematics 2017-06-20 Oliver Knill

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

Computational Complexity · Computer Science 2020-11-17 Balagopal Komarath , Anurag Pandey , C. S. Rahul

Given a hyperplane arrangement in a complex vector space of dimension n, there is a natural associated arrangement of codimension k subspaces in a complex vector space of dimension k*n. Topological invariants of the complement of this…

Algebraic Topology · Mathematics 2007-05-23 Daniel C. Cohen , Frederick R. Cohen , Miguel Xicotencatl

We generalize the notion of semi-normalized classes of systems of differential equations, study properties of such classes and extend the algebraic method of group classification to them. In particular, we prove the important theorems on…

Mathematical Physics · Physics 2024-09-02 Celestin Kurujyibwami , Dmytro R. Popovych , Roman O. Popovych

We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…

Combinatorics · Mathematics 2024-08-20 Youming Qiao

Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…

Combinatorics · Mathematics 2024-08-30 Evgeny A. Bespalov , Denis S. Krotov

We study the derived category of pseudo-coherent complexes over a noetherian commutative ring, building on prior work by Matsui-Takahashi. Our main theorem is a computation of the Balmer spectrum of this category in the case of a discrete…

Commutative Algebra · Mathematics 2025-08-26 Beren Sanders , Yufei Zhang

In this paper we unify several existing regularity conditions for graphs, including strong regularity, $k$-isoregularity, and the $t$-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using…

Combinatorics · Mathematics 2020-02-17 Christian Pech

We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…

Information Theory · Computer Science 2019-11-25 Carlos Galindo , Fernando Hernando , Diego Ruano

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

Algebraic Geometry · Mathematics 2026-05-05 Enrico Savi

We study the almost complete intersection ring $R$ defined by $n+1$ general quadrics in a polynomial ring in $n$ variables over a field $\sf{k}$ and a corresponding linked Gorenstein ring $A$. The overarching theme is that, while not Koszul…

Commutative Algebra · Mathematics 2026-02-11 Rachel Diethorn , Sema Güntürkün , Alexis Hardesty , Pinar Mete , Liana Şega , Aleksandra Sobieska , Oana Veliche

It is shown that the description of certain class of representations of the holonomy Lie algebra associated to hyperplane arrangement $\Delta$ is essentially equivalent to the classification of $\vee$-systems associated to $\Delta.$ The…

Representation Theory · Mathematics 2017-04-17 M. V. Feigin , A. P. Veselov

A multifold $1$-perfect code ($1$-perfect code for list decoding) in any graph is a set $C$ of vertices such that every vertex of the graph is at distance not more than $1$ from exactly $\mu$ elements of $C$. In $q$-ary Hamming graphs,…

Combinatorics · Mathematics 2024-07-15 Denis S. Krotov