Imagen de Portada

Positional Identifiability from Pairwise Collision Data

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Yun-Han, Shomorony, Ilan, Milenkovic, Olgica
Formato:	Preprint
Publicado:	2026
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
por: Li, Yun-Han, et al.
Publicado: (2024)

Pairwise similarity method for majority domination problem
por: Shushko, N. I., et al.
Publicado: (2025)

On Generalizations of Pairwise Compatibility Graphs
por: Calamoneri, Tiziana, et al.
Publicado: (2021)

A Method to Generate Multi-interval Pairwise Compatibility Graphs
por: Hayat, Seemab, et al.
Publicado: (2024)

N-Way Joint Mutual Exclusion Does Not Imply Any Pairwise Mutual Exclusion for Propositions
por: Freedman, Roy S.
Publicado: (2024)

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
por: la Tour, Max Dupré, et al.
Publicado: (2025)

Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
por: Miyashita, Rikuya, et al.
Publicado: (2024)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

Progress on Self Identifying Codes
por: Jean, Devin, et al.
Publicado: (2025)

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
por: Elbassioni, Khaled
Publicado: (2024)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026)

Mutation-Guided Differentiable Quadratic Combinatorial Optimization
por: Sun, Yongliang, et al.
Publicado: (2026)

Broadcast Graph Is NP-complete
por: Xu, Jinghan, et al.
Publicado: (2024)

Improving Data Cleaning Using Discrete Optimization
por: Smith, Kenneth, et al.
Publicado: (2024)

A Euclidean Distance Matrix Model for Convex Clustering
por: Wang, Zhaowei, et al.
Publicado: (2021)

The Freight Multimodal Transport Problem with Buses and Drones: An Integrated Approach for Last-Mile Delivery
por: Su, E, et al.
Publicado: (2025)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
por: Tu, Ziran, et al.
Publicado: (2024)

Generalized Resistance Geometry from Kron Reduction and Effective Resistance
por: Kajiura, Yosuke, et al.
Publicado: (2026)

Robot Positioning Using Torus Packing for Multisets
por: Chen, Chung Shue, et al.
Publicado: (2024)

Conflict-free chromatic index of trees
por: Guo, Shanshan, et al.
Publicado: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2023)

Matchings on Random Regular Hypergraphs
por: Li, Zhongyang
Publicado: (2021)

Mixed Unit Interval Bigraphs : A Characterization
por: Das, Ashok Kumar, et al.
Publicado: (2026)

Injective and pseudo-injective polynomial equations: From permutations to dynamical systems
por: Porreca, Antonio E., et al.
Publicado: (2026)

A Boolean encoding of the Most Permissive semantics for Boolean networks
por: de Chancel, Laure, et al.
Publicado: (2026)

Binary constraints on one additional variable can create exponential ascents
por: Cohen, David A., et al.
Publicado: (2026)

Efficient Reconstruction of Arboreal Networks
por: Huber, Katharina T., et al.
Publicado: (2026)

Multipacking on graphs and Euclidean metric space
por: Islam, Sk Samim
Publicado: (2026)

Majority Boolean networks classifying density: structural characterization and complexity
por: Perrot, Kévin, et al.
Publicado: (2026)

The Balanced Up-Down Walk
por: Akitaya, Hugo A., et al.
Publicado: (2026)

On the existence of heavy columns in binary matrices with distinct rows
por: Abdurakhmanov, Jamolidin K.
Publicado: (2026)

Another Way to Lower the Bound for Distinct Squares
por: Tomita, Eitatsu, et al.
Publicado: (2026)

Finding Minimal Clusters in st-DAGs
por: Vogl, Ulrich, et al.
Publicado: (2026)

A formal proof of the Sands-Sauer-Woodrow theorem using the Rocq prover and mathcomp/ssreflect
por: Chancelier, Jean-Philippe
Publicado: (2026)

Trapping and commutative Boolean networks
por: Gadouleau, Maximilien
Publicado: (2026)

An Identity for Catalan Numbers via Restricted Dyck Paths
por: Bernini, Antonio, et al.
Publicado: (2026)

On scheduling coupled tasks with exact delays to minimize maximum lateness
por: Kubiak, Wiesław
Publicado: (2026)

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
por: Hommelsheim, Felix, et al.
Publicado: (2026)

Effective approach of the tridendriform Schroeder tree algebra
por: Catoire, Pierre, et al.
Publicado: (2026)

Boxicity of Zero Divisor Graphs
por: Chandran, L. Sunil, et al.
Publicado: (2025)