相关论文: Computing Maximal Chains

The maximal sum of a sequence "A" of "n" real numbers is the greatest sum of all elements of any strictly contiguous and possibly empty subsequence of "A", and it can be computed in "O(n)" time by means of Kadane's algorithm. Letting "A^(x…

The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…

Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and…

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

We establish sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. The new assumption, localized continuity, is formalized with the help of the notion of context trees, and includes the…

A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…

Meshalkin's theorem states that a class of ordered p-partitions of an n-set has at most $\max \binom{n}{a_1,...,a_p}$ members if for each k the k'th parts form an antichain. We give a new proof of this and the corresponding LYM inequality…

We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…

This research addresses the multiprocessor scheduling problem of hard real-time systems, and it especially focuses on optimal and global schedulers when practical constraints are taken into account. First, we propose an improvement of the…

Clustering is a widely used unsupervised learning method for finding structure in the data. However, the resulting clusters are typically presented without any guarantees on their robustness; slightly changing the used data sample or…

Complex networks contain complete subgraphs such as nodes, edges, triangles, etc., referred to as simplices and cliques of different orders. Notably, cavities consisting of higher-order cliques play an important role in brain functions.…

The trace of a family of sets $\mathcal{A}$ on a set $X$ is $\mathcal{A}|_X=\{A\cap X:A\in \mathcal{A}\}$. If $\mathcal{A}$ is a family of $k$-sets from an $n$-set such that for any $r$-subset $X$ the trace $\mathcal{A}|_X$ does not contain…

We provide quantitative weighted estimates for the $L^p(w)$ norm of a maximal operator associated to cube skeletons in $\mathbb{R}^n$. The method of proof differs from the usual in the area of weighted inequalities since there are no…

Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which…

In this paper we investigate the covering machinery of the Jensen-Steel core model $K$, under the hypothesis that there is no inner model with a Woodin cardinal. In an earlier work, Mitchell and the first author showed that if…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal…

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…

We study ranked enumeration of join-query results according to very general orders defined by selective dioids. Our main contribution is a framework for ranked enumeration over a class of dynamic programming problems that generalizes…

One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…