相关论文: On Farkas Lemma and Dimensional Rigidity of Bar Fr…

We introduce spiky rank, a new matrix parameter that enhances blocky rank by combining the combinatorial structure of the latter with linear-algebraic flexibility. A spiky matrix is block-structured with diagonal blocks that are arbitrary…

In this note, we present an elementary proof of the fact that the slice rank of a trilinear form over a finite field is bounded above by a linear expression in the analytic rank. The existing proofs by Adiprasito-Kazhdan-Ziegler and…

Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…

In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric codes and Ferrers diagram rank metric codes. These upper bounds yield the rank distance Singleton bound and an…

In this paper we prove a conjectured modular equation of Farkas and Kra, which involving a half sum of certain modular form of weight $1$ for congruence subgroup $\Gamma_1(k)$ with any prime $k$. We prove that their conjectured identity…

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

In this paper we show that an instance of dividing in pseudofinite structures can be witnessed by a drop of the pseudofinite dimension. As an application of this result we give new proofs of known results for asymptotic classes of finite…

A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…

We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well…

In "Universal rigidity on the line, point orde" it is shown, answering a question of Jord\'an and Nguyen, that universal rigidity of a generic bar-joint framework in R^1 depends on more than the ordering of the vertices. The graph G that…

We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances…

We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for…

We revisit finite racks and quandles using a perspective based on permutations which can aid in the understanding of the structure. As a consequence we recover old results and prove new ones. We also present and analyze several examples.

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

We study the convergence of resistance metrics and resistance forms on a converging sequence of spaces. As an application, we study the existence and uniqueness of self-similar Dirichlet forms on Sierpinski gaskets with added rotated…

We remark that forcing on fiber bundles of structures of first order languages is not a compatible semantics with the pullback (of fiber bundles) and we describe a semantics which behaves well with respect to it. This new semantics uses…

We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations,…

The scope of this work is the constraint-based synthesis of termination arguments for the restricted class of programs called linear lasso programs. A termination argument consists of a ranking function as well as a set of supporting…

We provide a self-contained exposition of the well-known multifractal formalism for self-similar measures satisfying the strong separation condition. At the heart of our method lies a pair of quasiconvex optimization problems which encode…

Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…