Local Borsuk-Ulam, Stability, and Replicability
Abstract
References
Index Terms
- Local Borsuk-Ulam, Stability, and Replicability
Recommendations
Degree versions of theorems on intersecting families via stability
AbstractFor a family of subsets of an n-element set, its matching number is the maximum number of pairwise disjoint sets. Families with matching number 1 are called intersecting. The famous Erdős–Ko–Rado theorem determines the size of the ...
Abel lemma-based finite-sum inequality and its application to stability analysis for linear discrete time-delay systems
This paper is concerned with stability of linear discrete time-delay systems. Note that a tighter estimation on a finite-sum term appearing in the forward difference of some Lyapunov functional leads to a less conservative delay-dependent stability ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/de19c9d1-d71b-445e-8b46-5fbe0094e40c/3618260.cover.jpg)
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- European Research Council
- Israel Science Foundation
- Villum Fonden
- Pioneer Fund
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)13
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in