English
Related papers

Related papers: A characterization of combinatorial demand

200 papers

Many loads have flexibility in demand that can be used to provide ancillary services to power grids. A large body of literature exists on designing algorithms to coordinate actions of many loads to provide such a service. The topic of…

Optimization and Control · Mathematics 2024-03-13 Prabir Barooah

The characteristic function of row contractions and liftings of row contractions are complete invariants up to unitary equivalence for row contractions and liftings of row contractions, respectively. We provide alternate proofs for these…

Functional Analysis · Mathematics 2023-02-01 Neeru Bala , Santanu Dey , Reshmi M. N

We give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.

Combinatorics · Mathematics 2007-05-23 Aidan Roy , Chris Godsil

The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…

Functional Analysis · Mathematics 2010-04-23 M. E. Shirokov

We study the second law in the context of combinatorial processes, focusing on the mechanisms that give rise to irreversible behavior from an underlying deterministic, invertible, and reversible dynamics.

Combinatorics · Mathematics 2026-05-19 Rafael Diaz

Motivated by the growing requirements on the operation of complex engineering systems, we present contracts as specifications for continuous-time linear dynamical systems with inputs and outputs. A contract is defined as a pair of…

Dynamical Systems · Mathematics 2021-09-17 B. M. Shali , A. J. van der Schaft , B. Besselink

This paper is an extended abstract of the dissertation presented by the author for the doctoral degree in physics and mathematics (in Russia). The main characteristic studied in the dissertation is combinatorial complexity, which is a…

Formal Languages and Automata Theory · Computer Science 2010-10-27 Arseny M. Shur

Many-to-many matching with contracts is studied in the framework of revealed preferences. All preferences are described by choice functions that satisfy natural conditions. Under a no-externality assumption individual preferences can be…

Computer Science and Game Theory · Computer Science 2020-03-05 Daniel Lehmann

The flow of contracting systems contracts 1-dimensional parallelotopes, i.e., line segments, at an exponential rate. One reason for the usefulness of contracting systems is that many interconnections of contracting sub-systems yield an…

Dynamical Systems · Mathematics 2022-10-20 Ron Ofir , Michael Margaliot , Yoash Levron , Jean-Jacques Slotine

The arithmetic function of two variables is defined. Some properties of the function are given along with the formula that is an analog of the so-called Mobius' inversion formula. A heuristic statement is suggested.

Number Theory · Mathematics 2007-05-23 P. A. Gustomesov

The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization…

Number Theory · Mathematics 2022-09-20 Michele Battagliola , Nadir Murru , Giordano Santilli

We give a few properties equivalent to the Bloch-Kato conjecture (now the norm residue isomorphism theorem).

Algebraic Geometry · Mathematics 2019-02-14 Bruno Kahn

Several primal and dual characterizations of regularity properties of collections of sets in normed linear spaces are discussed. Relationships between regularity properties of collections of sets and those of set-valued mappings are…

Optimization and Control · Mathematics 2015-01-20 Alexander Kruger , Nguyen Hieu Thao

In the combinatorial-action contract model (D\"utting et al., FOCS'21) a principal delegates the execution of a complex project to an agent, who can choose any subset from a given set of actions. Each set of actions incurs a cost to the…

Computer Science and Game Theory · Computer Science 2025-11-27 Paul Dütting , Michal Feldman , Yoav Gal-Tzur , Aviad Rubinstein

We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

Dependence on the parameter is continuous when perturbations of the parameter preserves strict preference for one alternative over another. We characterise this property via a utility function over alternatives that depends continuously on…

Computer Science and Game Theory · Computer Science 2019-04-01 Patrick H. O'Callaghan

Consistency properties of concurrent computations, e.g., sequential consistency, linearizability, or eventual consistency, are essential for devising correct concurrent algorithms. In this paper, we present a logical formalization of such…

Logic in Computer Science · Computer Science 2013-05-13 Klaus v. Gleissenthall , Andrey Rybalchenko

We provide an axiomatic characterization of lexicographic preferences over the set of all random availability functions using two assumptions. The first assumption is strong monotonicity, which in our framework is equivalent to the strong…

Theoretical Economics · Economics 2025-11-03 Somdeb Lahiri

Interestingness is an important criterion by which we judge knowledge discovery. But, interestingness has escaped all attempts to capture its intuitive meaning into a concise and comprehensive form. A unifying paradigm is formulated by…

Information Retrieval · Computer Science 2014-04-03 Iaakov Exman

The consrtuction of self-similar fuctions in $L_2[0,1]$ is described. Some properties of such funtions (boundness of variation, continuity etc.) is obtained.

Functional Analysis · Mathematics 2007-05-23 I. A. Sheipak