Related papers: Complexities of Erez self-dual normal bases
In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…
For extra-large Coxeter systems (m(s,r)>3), we construct a natural and explicit set of Soergel bimodules D={D_w}_{w\in W} such that each D_w contains as a direct summand (or is equal to) the indecomposable Soergel bimodule B_w. When…
We construct families of trivial $2$-knots $K_i$ in $\mathbb{R}^4$ such that the maximal complexity of $2$-knots in any isotopy connecting $K_i$ with the standard unknot grows faster than a tower of exponentials of any fixed height of the…
G. Edelman, O. Sporns, and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural…
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…
A simple yet general method for constructing basis sets for molecular electronic structure calculations is presented. These basis sets consist of atomic natural orbitals from a multi-configurational self-consistent field calculation…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…
Complex-linearization of a class of systems of second order ordinary differential equations (ODEs) has already been studied with complex symmetry analysis. Linearization of this class has been achieved earlier by complex method, however,…
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…
A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…
A class of discrete equations is considered from three perspectives corresponding to three measures of the complexity of solutions: the (hyper-) order of meromorphic solutions in the sense of Nevanlinna, the degree growth of iterates over a…
The classical Lorenz lowest order system of three nonlinear ordinary differential equations, capable of producing chaotic solutions, has been generalized by various authors in two main directions: (i) for number of equations larger than…
In this paper we consider the classification of minimal cellular structures of spaces of topological complexity two under some hypotheses on there graded cohomological algebra. This continues the method used by M.Grant et al. in [1].
This work establishes simple criteria for detecting higher rational singularities via the intersection Du Bois complex and the irrationality complex of a normal variety over the complex numbers.
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
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…
The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…
A measure of complexity based on a probabilistic description of physical systems is proposed. This measure incorporates the main features of the intuitive notion of such a magnitude. It can be applied to many physical situations and to…