Related papers: A characterization of combinatorial demand
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We study the properties of input-consuming derivations of moded logic programs. Input-consuming derivations can be used to model the behavior of logic programs using dynamic scheduling and employing constructs such as delay declarations. We…
We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…
This paper concerns generalized differential characterizations of maximal monotone set-valued mappings. Using advanced tools of variational analysis, we establish coderivative criteria for maximal monotonicity of set-valued mappings, which…
From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…
In a recent paper a class of infinite Jacobi matrices with discrete character of spectra has been introduced. With each Jacobi matrix from this class an analytic function is associated, called the characteristic function, whose zero set…
In this work we characterize the combinatorial metrics admitting a MacWilliams-type identity and describe the group of linear isometries of such metrics. Considering coverings that are not connected, we classify the metrics satisfying the…
Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…
We prove two conjectures on correlation inequalities for functions that are linear combinations of unimodal Boolean monotone nondecreasing functions
Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…
A double auction game with an infinite number of buyers and sellers is introduced. All sellers posses one unit of a good, all buyers desire to buy one unit. Each seller and each buyer has a private valuation of the good. The distribution of…
This note is devotes to some remarks regarding the use of variational methods, of minimax type, to establish continuity type results
We provide new necessary and sufficient conditons for ensuring strong quasiconvexity in the nonsmooth case and, as a consequence, we provide a proof for the differentiable case. Furthermore, we improve the quadratic growth property for…
We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.
In this paper, on the basis of a specific question raised in [6], we further continue our investigations on the uniqueness of a meromorphic function with its higher derivatives sharing two sets and answer the question affirmatively.…
A general theory of innovation and progress in human society is outlined, based on the combat between two opposite forces (conservatism/inertia and speculative herding "bubble" behavior). We contend that human affairs are characterized by…
Poisson processes and one-dimensional Poisson point processes satisfy three main properties: superposition, thinning, and conditioning. The proof of the first two relies on basic estimates involving the Poisson distribution that are also…
We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are "locally commutative" concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values.