Given a rank 3 real arrangement A of n lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for n sufficiently large, the number of simple intersection points of A is greater than or equal to n/2. With a much simpler proof we show that if A is supersolvable, then the conjecture is true for any n (a small improvement of original conjecture). The Slope problem (proved by Ungar in 1982) states that n non-collinear points in the real plane determine at least n − 1 slopes; we show that this is equivalent to providing a lower bound on the multiplicity of a modular point in any (real) supersolvable arrangement. In the second part we find connections between the number of simple points of a supersolvable line arrangement, over any field of characteristic 0, and the degree of the reduced Jacobian scheme of the arrangement. Over the complex numbers even though the Sylvester-Gallai theorem fails to be true, we conjecture that the supersolvable version of the Dirac-Motzkin conjecture is true.
ABSTRACT. From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the matrix is generic and we obtain the usual star configurations. In our main result, we show that the degree of a generalized star configuration as a projective scheme is determined by the Tutte polynomial of the code. In the process, we obtain preliminary results on the primary decomposition of the defining ideals of these schemes. Additionally, we conjecture that these ideals have linear minimal free resolutions and prove partial results in this direction.
ABSTRACT. We show that errors in data transmitted through linear codes can be thought of as codewords of minimum weight of new linear codes. To determine errors we can then use methods specific to finding such special codewords. One of these methods consists of finding the primary decomposition of the saturation of a certain homogeneous ideal. When good words (i.e. vectors with a unique nearest neighbor) are error-corrected, the saturated ideal is just the prime ideal of a point (so the primary decomposition is superfluously determined); we show that this ideal can be computed by coloning the original homogeneous ideal with a power of a certain variable. We then determine the smallest such power for any linear code.
From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the matrix is generic and we obtain the usual star configurations. In our main result, we show that the degree of a generalized star configuration as a projective scheme is determined by the Tutte polynomial of the code. In the process, we obtain preliminary results on the primary decomposition of the defining ideals of these schemes. Additionally, we conjecture that these ideals have linear minimal free resolutions and prove partial results in this direction.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.