English
Related papers

Related papers: Some advances on the set covering polyhedron of ci…

200 papers

We study the set covering polyhedron related to circulant matrices. In particular, our goal is to characterize the first Chv\'atal closure of the usual fractional relaxation. We present a family of valid inequalities that generalizes the…

Combinatorics · Mathematics 2014-06-19 Paola B. Tolomei , Luis M. Torres

In this work we give a complete description of the set covering polyhedron of circulant matrices $C^k_{sk}$ with $s = 2,3$ and $k\geq 3 $ by linear inequalities. In particular, we prove that every non boolean facet defining inequality is…

Combinatorics · Mathematics 2012-06-07 Silvia M. Bianchi , Graciela L. Nasini , Paola B. Tolomei

We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…

Combinatorics · Mathematics 2017-10-10 Néstor E. Aguilera , Ricardo D. Katz , Paola B. Tolomei

Given a combinatorial optimization problem $\Pi$ and an increasing finite sequence $c$ of natural numbers, we obtain a cardinality constrained version $\Pi_c$ of $\Pi$ by permitting only those feasible solutions of $\Pi$ whose cardinalities…

Combinatorics · Mathematics 2009-02-12 Jean F. Maurras , Ruediger Stephan

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

Combinatorics · Mathematics 2018-12-07 Latife Genc-Kaya , J. N. Hooker

In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…

Discrete Mathematics · Computer Science 2014-05-28 Isabel Méndez-Díaz , Graciela Nasini , Daniel Severin

In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…

Discrete Mathematics · Computer Science 2015-03-19 Isabel Méndez-Díaz , Graciela Nasini , Daniel Severin

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

Combinatorics · Mathematics 2009-09-21 Daniel Appel

Circulant contraction minors play a key role for characterizing ideal circular matrices in terms of minimally non ideal structures. In this article we prove necessary and sufficient conditions for a circular matrix $A$ to have circulant…

Combinatorics · Mathematics 2019-02-11 Silvia Bianchi , Graciela Nasini , Paola Tolomei , Luis Miguel Torres

We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…

Classical Analysis and ODEs · Mathematics 2014-02-19 Emanuel Indrei , Levon Nurbekyan

We show that for certain arithmetic groups, geometrically finite subgroups are the intersection of finite index subgroups containing them. Examples are the Bianchi groups and the Seifert-Weber dodecahedral space. In particular, for…

Geometric Topology · Mathematics 2007-05-23 Ian Agol , Darren D. Long , Alan W. Reid

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

Computational Geometry · Computer Science 2026-04-30 Reilly Browne

We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…

Computational Complexity · Computer Science 2022-05-04 Heng Guo , Mark Jerrum

Due to their rich algebraic structures and various applications, circulant matrices have been of interest and continuously studied. In this paper, the notions of Binomial-related matrices have been introduced. Such matrices are circulant…

Rings and Algebras · Mathematics 2018-04-05 Trairat Jantaramas , Somphong Jitman , Pornpan Kaewsaard

We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…

Optimization and Control · Mathematics 2019-03-05 Hamidur Rahman , Ashutosh Mahajan

In this paper, we study norms of circulant and $r-$circulant matrices involving harmonic Fibonacci and hyperharmonic Fibonacci numbers. We obtain inequalities by using matrix norms.

Number Theory · Mathematics 2016-03-28 Naim Tuglu , Can Kizilateş

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

Combinatorics · Mathematics 2019-10-31 Augusto Ferrante , Fabrizio Padula , Lorenzo Ntogramatzidis

We state a number of conjectures that together allow one to classify a broad class of del Pezzo surfaces with cyclic quotient singularities using mirror symmetry. We prove our conjectures in the simplest cases. The conjectures relate…

This paper is devoted to the study of mappings with finite distortion, in particular, mappings satisfying the inverse Poletskii inequality. We study the problem of equicontinuity of families of such mappings in a given domain. We establish…

Complex Variables · Mathematics 2026-05-21 Miodrag Mateljevic , Evgeny Sevost'yanov

We introduce and investigate the resolvent order, which is a binary relation on the set of firmly nonexpansive mappings. It unifies well-known orders introduced by Loewner (for positive semidefinite matrices) and by Zarantonello (for…

Functional Analysis · Mathematics 2016-06-29 Sedi Bartz , Heinz H. Bauschke , Xianfu Wang
‹ Prev 1 2 3 10 Next ›