Related papers: Log-balanced combinatorial sequences
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…
Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big…
A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…
In this paper, we focus on the problem of determining whether two conjunctive ("CQ") queries posed on relational data are combined-semantics equivalent [9]. We continue the tradition of [2,5,9] of studying this problem using the tool of…
We consider the convex bilevel optimization problem, also known as simple bilevel programming. There are two challenges in solving convex bilevel optimization problems. Firstly, strong duality is not guaranteed due to the lack of Slater…
We present an approach to proving the 2-log-convexity of sequences satisfying three-term recurrence relations. We show that the Apery numbers, the Cohen-Rhin numbers, the Motzkin numbers, the Fine numbers, the Franel numbers of order 3 and…
A new delay equation is introduced to describe the punctuated evolution of complex nonlinear systems. A detailed analytical and numerical investigation provides the classification of all possible types of solutions for the dynamics of a…
We study mean convergence results for weighted multiple ergodic averages defined by commuting transformations with iterates given by integer polynomials in several variables. Roughly speaking, we prove that a bounded sequence is a good…
In this paper we give refinements of some convex and log-convex moment inequalities of the first and second order using a special kind of positive semi-definite form. An open problem concerning eight parameter refinement of second order is…
We study properties of !-limit sets of multivalued semiflows like chain recurrence or the existence of cyclic chains. First, we prove that under certain conditions the omega-limit set of a trajectory is chain recurrent, applying this result…
Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the answers will stay…
We present sufficient conditions under which a given linear nonautonomous system and its nonlinear perturbation are topologically conjugated. Our conditions are of a very general form and provided that the nonlinear perturbations are…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
This paper presents a novel methodology for evaluating the boundedness, stability, and instability of some vector nonlinear systems with multiple time-varying delays and variable coefficients. The proposed technique develops two scalar…
Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…
This paper concerns non-overlapping codes, block codes motivated by synchronisation and DNA-based storage applications. Most existing constructions of these codes do not account for the restrictions posed by the physical properties of…
We prove that if a standard determinantal scheme is level, then its h-vector is a log-concave pure O-sequence, and conjecture that the converse also holds. Among other cases, we prove the conjecture in codimension two, or when the entries…