English
Related papers

Related papers: A short proof that all linear codes are weakly alg…

200 papers

If in a given rank $r$, there is an irreducible complex local system with torsion determinant and quasi-unipotent monodromies at infinity on a smooth quasi-projective variety, then for every prime number $\ell$, there is an absolutely…

Algebraic Geometry · Mathematics 2023-02-22 Johan de Jong , Hélène Esnault

In this paper, we prove the Gallai-Edmonds structure theorem for the most general matching polynomial. Our result implies the Parter-Wiener theorem and its recent generalization about the existence of principal submatrices of a Hermitian…

Combinatorics · Mathematics 2010-06-08 Cheng Yeaw Ku , Kok Bin Wong

We prove that algebras are left weakly Gorenstein in case the subcategory $^{\perp}A \cap \Omega^n(A)$ is representation-finite. This applies in particular to all monomial algebras and endomorphism algebras of modules over…

Representation Theory · Mathematics 2023-10-30 Rene Marczinzik

We establish a Ross-Witt Nystr\"om correspondence for weak geodesic lines in the (completed) space of K\"ahler metrics. We construct a wide range of weak geodesic lines on arbitrary projective K\"ahler manifolds that are not generated by…

Differential Geometry · Mathematics 2026-02-16 Tamás Darvas , Nicholas McCleerey

We prove that, for every complex Hilbert space $H$, every weak-2-local derivation on $B(H)$ or on $K(H)$ is a linear derivation. We also establish that every weak-2-local derivation on an atomic von Neumann algebra or on a compact…

Operator Algebras · Mathematics 2017-04-05 Juan Carlos Cabello , Antonio M. Peralta

We show that infinitely many Gorenstein weakly-exceptional quotient singularities exist in all dimensions, we prove a weak-exceptionality criterion for five-dimensional quotient singularities, and we find a sufficient condition for being…

Algebraic Geometry · Mathematics 2012-05-25 Ivan Cheltsov , Constantin Shramov

In this note we give an axiomatization of Boolean algebras based on weakly dicomplemented lattices: an algebra $(L,\wedge,\vee,\tu)$ of type $(2,2,1)$ is a Boolean algebra iff $(L,\wedge,\vee)$ is a non empty lattice and $(x\wedge…

Logic · Mathematics 2009-07-08 Leonard Kwuida

A theorem of Davis, Figiel, Johnson and Pe{\l}czy\'nski tells us that weakly-compact operators between Banach spaces factor through reflexive Banach spaces. The machinery underlying this result is that of the real interpolation method,…

Functional Analysis · Mathematics 2007-05-23 Matthew Daws

We give an elementary proof of a generalization of Bourgain and Tzafriri's Restricted Invertibility Theorem, which says roughly that any matrix with columns of unit length and bounded operator norm has a large coordinate subspace on which…

Functional Analysis · Mathematics 2010-10-05 Daniel A. Spielman , Nikhil Srivastava

We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynomial polar codes which include PAC codes and Reverse PAC…

Information Theory · Computer Science 2026-01-16 Vlad-Florin Dragoi , Mohammad Rowshan

We give a soft geometric proof of the classical result due to Conn stating that a Poisson structure is linearizable around a singular point (zero) at which the isotropy Lie algebra is compact and semisimple.

Symplectic Geometry · Mathematics 2008-12-17 Marius Crainic , Rui Loja Fernandes

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

Combinatorics · Mathematics 2017-01-31 June Huh , Botong Wang

We say that a binary linear code C has a geometric representation if there exists a two dimensional simplicial complex D such that C is a punctured code of the kernel ker D of the incidence matrix of D and dim C = dim ker D. We show that…

Combinatorics · Mathematics 2012-12-06 Pavel Rytíř

We give the operadic formulation of (weak, strong) topological vertex algebras, which are variants of topological vertex operator algebras studied recently by Lian and Zuckerman. As an application, we obtain a conceptual and geometric…

High Energy Physics - Theory · Physics 2009-10-22 Yi-Zhi Huang

Let (X,L) be a polarized compact manifold, i.e. L is an ample line bundle over X and denote by H the infinite dimensional space of all positively curved Hermitian metrics on L equipped with the Mabuchi metric. In this short note we show,…

Differential Geometry · Mathematics 2014-05-27 Robert J. Berman

The Lloyd Theorem of (Sol\'e, 1989) is combined with the Schwartz-Zippel Lemma of theoretical computer science to derive non-existence results for perfect codes in the Lee metric, NRT metric, mixed Hamming metric, and for the sum-rank…

Combinatorics · Mathematics 2026-01-21 Minjia Shi , Jing Wang , Patrick Solé

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…

Information Theory · Computer Science 2016-02-05 Chunming Tang , Can Xiang , Keqin Feng

Badzioch and Bergner proved a rigidification theorem saying that each homotopy simplicial algebra is weakly equivalent to a simplicial algebra. The question is whether this result can be extended from algebraic theories to finite limit…

Category Theory · Mathematics 2016-01-19 J. Rosicky

The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…

Group Theory · Mathematics 2013-11-25 Gopal Prasad , Andrei S. Rapinchuk

A closed curve in the plane is weakly simple if it is the limit (in the Fr\'echet metric) of a sequence of simple closed curves. We describe an algorithm to determine whether a closed walk of length n in a simple plane graph is weakly…

Computational Geometry · Computer Science 2015-03-30 Hsien-Chih Chang , Jeff Erickson , Chao Xu