Sign rank versus VC dimension

This work studies the maximum possible sign rank of $N \times N$ sign matrices with a given VC dimension $d$. For $d=1$, this maximum is {three}. For $d=2$, this maximum is $\tilde{\Theta}(N^{1/2})$. For $d >2$, similar but slightly less accurate statements hold. {The lower bounds improve over previous ones by Ben-David et al., and the upper bounds are novel.} The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given VC dimension, and the number of maximum classes of a given VC dimension -- answering a question of Frankl from '89, and (ii) design an efficient algorithm that provides an $O(N/\log(N))$ multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the $N \times N$ adjacency matrix of a $\Delta$ regular graph with a second eigenvalue of absolute value $\lambda$ and $\Delta \leq N/2$. We show that the sign rank of the signed version of this matrix is at least $\Delta/\lambda$. We use this connection to prove the existence of a maximum class $C\subseteq\{\pm 1\}^N$ with VC dimension $2$ and sign rank $\tilde{\Theta}(N^{1/2})$. This answers a question of Ben-David et al.~regarding the sign rank of large VC classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics.Comment: 33 pages. This is a revised version of the paper "Sign rank versus VC dimension". Additional results in this version: (i) Estimates on the number of maximum VC classes (answering a question of Frankl from '89). (ii) Estimates on the sign rank of large VC classes (answering a question of Ben-David et al. from '03). (iii) A discussion on the computational complexity of computing the sign-ran

MGOS: A library for molecular geometry and its operating system

The geometry of atomic arrangement underpins the structural understanding of molecules in many fields. However, no general framework of mathematical/computational theory for the geometry of atomic arrangement exists. Here we present "Molecular Geometry (MG)'' as a theoretical framework accompanied by "MG Operating System (MGOS)'' which consists of callable functions implementing the MG theory. MG allows researchers to model complicated molecular structure problems in terms of elementary yet standard notions of volume, area, etc. and MGOS frees them from the hard and tedious task of developing/implementing geometric algorithms so that they can focus more on their primary research issues. MG facilitates simpler modeling of molecular structure problems; MGOS functions can be conveniently embedded in application programs for the efficient and accurate solution of geometric queries involving atomic arrangements. The use of MGOS in problems involving spherical entities is akin to the use of math libraries in general purpose programming languages in science and engineering. (C) 2019 The Author(s). Published by Elsevier B.V

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig

Stability and Vortex Shedding of Bluff Body Arrays

The primary purpose of this study was to develop an understanding of the stability of laminar flow through bluff body arrays, and investigate the nature of the unsteady vortex shedding regime that follows. The flow was numerically investigated using a specially developed multi-domain spectral element solver. Important criteria in the solver development were flexibility, efficiency, and accuracy. Flexibility was critical to the functionality of the code, as arrays of varying geometry were investigated. Efficiency with a high degree of accuracy was also of primary importance, with the code implemented to run efficiently on today's massively parallel architectures. Numerical two-dimensional stability analysis of the flow in several configurations of inline and staggered array geometries was performed. The growth rate, eigenfunction, and frequency of the disturbances were determined. The critical Reynolds number for flow transition in each case was identified and compared to that of flow over a single body. Based on the solutions of the laminar flow, a one-dimensional analytical analysis was performed on selected velocity profiles in the wake region. The results of this analysis were used to guide the interpretation of the two dimensional results and formulate a general theory of stability of inline and staggered bluff body arrays. The nature of the flow in the unsteady regime following the onset of instability was examined for an inline and a staggered arrangement. Particular attention was focused on the vortex shedding which was visualized and quantified through computation of the flow swirl, a quantity which identifies regions of rotary motion. The conditions required for the generation of leading edge vortex shedding were identified and discussed. Finally, a third geometry related to the inline and staggered arrays was considered. Flow solution data for this geometry is presented and its suitability as a model for louvered arrays was discussed.Air Conditioning and Refrigeration Project 11

Multiscale computational first order homogenization of thick shells for the analysis of out-of-plane loaded masonry walls

This work presents a multiscale method based on computational homogenization for the analysis of general heterogeneous thick shell structures, with special focus on periodic brick-masonry walls. The proposed method is designed for the analysis of shells whose micro-structure is heterogeneous in the in-plane directions, but initially homogeneous in the shell-thickness direction, a structural topology that can be found in single-leaf brick masonry walls. Under this assumption, this work proposes an efficient homogenization scheme where both the macro-scale and the micro-scale are described by the same shell theory. The proposed method is then applied to the analysis of out-of-plane loaded brick-masonry walls, and compared to experimental and micro-modeling results.Peer ReviewedPostprint (author's final draft