A5018378648- Computational Geometry and Mesh Generation
- Advanced Graph Theory Research
- graph theory and CDMA systems
- Mathematics and Applications
- Limits and Structures in Graph Theory
- Point processes and geometric inequalities
- Advanced Combinatorial Mathematics
- Digital Image Processing Techniques
- Topological and Geometric Data Analysis
- Finite Group Theory Research
- Advanced Topology and Set Theory
- Graph theory and applications
- Advanced Theoretical and Applied Studies in Material Sciences and Geometry
- Advanced Numerical Analysis Techniques
- Quasicrystal Structures and Properties
- Geometric and Algebraic Topology
- Facility Location and Emergency Management
- Complexity and Algorithms in Graphs
- semigroups and automata theory
- Data Management and Algorithms
- Mathematical Dynamics and Fractals
- Graph Labeling and Dimension Problems
- Structural Analysis and Optimization
- Homotopy and Cohomology in Algebraic Topology
- Algebraic structures and combinatorial models
Universidad Nacional Autónoma de México
2013-2025
Polytechnic University of Queretaro
2022
Alfréd Rényi Institute of Mathematics
2010-2016
University College London
2016
University of Castilla-La Mancha
2016
Complejo Hospitalario Universitario de Toledo
2016
University of Szeged
2016
Western Kentucky University
2016
University of Calgary
2001-2006
Abstract In this paper, we present a unique four‐dimensional body of constant width based on the classical notion focal conics.
Abstract We study S -convex sets, which are the geometric objects obtained as intersection of usual convex sets in ℝ d with a proper subset ⊂ , and contribute new results about their -Helly numbers. extend prior work for = ℤ − k × give some sharp bounds several cases: low-dimensional situations, that have algebraic structure, particular when is an arbitrary subgroup or difference between lattice its sublattices. By abstracting ingredients Lovász method we obtain colorful versions many...
We study $S$-convex sets, which are the geometric objects obtained as intersection of usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. contribute new results about their $S$-Helly numbers. extend prior work for $S=\mathbb R^d$, Z^d$, and Z^{d-k}\times\mathbb R^k$; we give sharp bounds on numbers several cases. considered situation low-dimensional $S$ that have some algebraic structure, particular when is an arbitrary subgroup or difference between lattice its...
In this paper, we develop a Helly–Gallai type theorem for piercing number on finite families of closed intervals in Rd, as well some bounds the lines and satisfying (p,3)-property.
The scenario approach developed by Calafiore and Campi to attack chance-constrained convex programs utilizes random sampling on the uncertainty parameter substitute original problem with a representative continuous optimization $N$ constraints which is relaxation of original. provided an explicit estimate size yield high-likelihood feasible solutions problem. They measured probability be violated optimal solution from $N$. This paper has two main contributions. First, we present...
Given a connected graph G with p vertices and q edges, the -graphicahedron is vertex-transitive simple abstract polytope of rank whose edge-graph isomorphic to Cayley symmetric group S associated . The paper explores combinatorial symmetry properties -graphicahedra, focussing in particular on transitivity their automorphism groups. We present detailed analysis graphicahedra for -star graphs K 1, -cycles C intimately related geometry infinite Euclidean Coxeter à − 1 can be viewed as an...