English
Related papers

Related papers: Minimal plus-one generated line arrangements with …

200 papers

The proximal point method for a special class of nonconvex multiobjective functions is studied in this paper. We show that the method is well defined and that the accumulation points of any generated sequence, if any, are Pareto--Clarke…

Optimization and Control · Mathematics 2017-02-20 G. C. Bento , O. P. Ferreira , V. L. Sousa Junior

We construct finite-dimensional projective representations of the mapping class groups of compact connected oriented surfaces having one boundary component using stated skein algebras.

Quantum Algebra · Mathematics 2022-08-29 Julien Korinman

We give two constructions of grading-restricted vertex (super)algebras. We first give a new construction of a class of grading-restricted vertex (super)algebras originally obtained by Meurman and Primc using a different method. This…

Quantum Algebra · Mathematics 2016-06-10 Yi-Zhi Huang

This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets…

Combinatorics · Mathematics 2022-01-07 Vito Napolitano , Olga Polverino , Paolo Santonastaso , Ferdinando Zullo

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

Combinatorics · Mathematics 2018-07-16 Oswin Aichholzer , Lukas Andritsch , Karin Baur , Birgit Vogtenhuber

In this paper we investigate the number of minimum weight codewords of some dual Algebraic-Geometric codes associated with the Giulietti-Korchm\'aros maximal curve, by computing the maximal number of intersections between the…

Combinatorics · Mathematics 2018-02-12 Daniele Bartoli , Matteo Bonini

A representation of an arbitrary system of strict linear inequalities in R^n as a system of points is proposed. The representation is obtained by using a so-called polarity. Based on this representation an algorithm for constructing a…

Discrete Mathematics · Computer Science 2008-02-15 K. S. Kobylkin

We study a class of convex-concave min-max problems in which the coupled component of the objective is linear in at least one of the two decision vectors. We identify such problem structure as interpolating between the bilinearly and…

Optimization and Control · Mathematics 2025-07-10 Ronak Mehta , Jelena Diakonikolas , Zaid Harchaoui

We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky's…

Combinatorics · Mathematics 2022-10-07 Richard Ehrenborg , Margaret Readdy , MLE Slone

Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization…

Data Structures and Algorithms · Computer Science 2013-06-19 Martin Fink , Sergey Pupyrev

For the rank regularized minimization problem, we introduce several kinds of stationary points by the problem itself and its equivalent reformulations including the mathematical program with an equilibrium constraint (MPEC), the global…

Optimization and Control · Mathematics 2019-06-27 Yulan Liu , Shaohua Pan

This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…

Information Theory · Computer Science 2011-03-31 Markus Grassl

One can realize higher laminations as positive configurations of points in the affine building. The duality pairings of Fock and Goncharov give pairings between higher laminations for two Langlands dual groups $G$ and $G^{\vee}$. These…

Combinatorics · Mathematics 2017-09-15 Ian Le

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

Combinatorics · Mathematics 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

The complement of a complex hyperplane arrangement is known to be homotopic to a minimal CW complex. There are several approaches to the minimality. In this paper, we restrict our attention to real two dimensional cases, and introduce the…

Algebraic Geometry · Mathematics 2011-05-18 Masahiko Yoshinaga

Multivalued projections are applied to the study of weighted least squares solutions of linear relations equations (or inclusions) and some of its applications. To this end a matrix representation of multivalued projections with respect to…

Functional Analysis · Mathematics 2023-01-31 Maria Laura Arias , Maximiliano Contino , Alejandra Maestripieri , Stefania Marcantognini

We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…

Optimization and Control · Mathematics 2016-08-12 D. Drusvyatskiy , A. D. Ioffe , A. S. Lewis

The $X$-rank of a point $p$ in projective space is the minimal number of points of an algebraic variety $X$ whose linear span contains $p$. This notion is naturally submultiplicative under tensor product. We study geometric conditions that…

Algebraic Geometry · Mathematics 2020-05-29 Edoardo Ballico , Alessandra Bernardi , Fulvio Gesmundo , Alessandro Oneto , Emanuele Ventura

We revisit the coordinatisation method for projective planes. First, we discuss how the behaviour of the additive and multiplicative loops can be described in terms of its action on the "vertical" line, and how this means one can…

Combinatorics · Mathematics 2016-09-07 Robert S. Coulter

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Information Theory · Computer Science 2014-10-15 Hugues Randriambololona
‹ Prev 1 8 9 10 Next ›