相关论文: Complete enumeration of two-Level orthogonal array…

In this paper we propose a procedure which allows the construction of a large family of FIR d x d matrix wavelet filters by exploiting the one-to-one correspondence between QMF systems and orthogonal operators which commute with the shifts…

The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…

This paper studies modular forms of rank four and level one. There are two possiblities for the isomorphism type of the space of modular forms that can arise from an irreducible representation of the modular group of rank four, and we…

A new methodology for the design of isophoric thinned arrays with a priori controlled pattern features is introduced. A fully analytical and general (i.e., valid for any lattice and set of weights) relationship between the autocorrelation…

A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this paper we establish a unified technique to enumerate odd…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

Let d=(d_1,d_2,..., d_n) be a vector of non-negative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1.…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

We generalize, to any space-time dimension, the unitarity bounds of highest weight UIR's of the conformal groups with Lie algebras $so(2,d)$. We classify gauge theories invariant under $so(2,d)$, both integral and half-integral spins. A…

We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…

A three-way (resp., two-way) two-dimensional automaton has a read-only input head that moves in three (resp., two) directions on a finite array of cells labelled by symbols of the input alphabet. Restricting the input head movement of a…

The subject of this paper are partial geometries $pg(s,t,\alpha)$ with parameters $s=d(d'-1), \ t=d'(d-1), \ \alpha=(d-1)(d'-1)$, $d, d' \ge 2$. In all known examples, $q=dd'$ is a power of 2 and the partial geometry arises from a maximal…

Except for Koshy who devotes seven pages to applications of Fibonacci Numbers to electric circuits, most books and the Fibonacci Quarterly have been relatively silent on applications of graphs and electric circuits to Fibonacci numbers.…

We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…

In this paper, we consider the problems of enumerating minimal vertex covers and minimal dominating sets with capacity and/or connectivity constraints. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree…

The lower and the upper irredundance numbers of a graph $G$, denoted $ir(G)$ and $IR(G)$ respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a…

Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper, we present a geometric approach to analyzing contractive and…

A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…

We consider the problem of finding the best nonnegative rank-2 approximation of an arbitrary nonnegative matrix. We first revisit the theory, including an explicit parametrization of all possible nonnegative factorizations of a nonnegative…

We prove an upper bound of the form $2^{O(d^2 \mathrm{polylog}\,d)}$ on the number of affine (resp. linear) equivalence classes of, by increasing order of generality, 2-level d-polytopes, d-cones and d-configurations. This in particular…