Index sets of classes of automatic structures

We obtain exact estimates in the arithmetical and analytical hierarchies of index sets of various classes of automatic models. We also obtain estimates for the existence problems for computable isomorphism and embedding of automatic structures.     

Complexity of some natural problems on the class of computable I-algebras

We study computable Boolean algebras with distinguished ideals (I-algebras for short). We prove that the isomorphism problem for computable I-algebras is Σ ₁ ¹ -complete and show that the computable isomorphism problem and the computable categoricity problem for computable I-algebras are Σ ₃ ⁰ -complete.     

A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences

In this paper, which may be considered a sequel to a recent article by Eric Rowland and Reem Yassawi, we present yet another approach for the automatic generation of automata (and an extension that we call congruence linear schemes) for the fast (log-time) determination of congruence properties, modulo small (and not so small!) prime powers, for a wide class of combinatorial sequences. Even more interesting than the new results that could be obtained is the illustrated methodology, that of designing ‘meta-algorithms’ that enable the computer to develop algorithms, that it (or another computer) can then proceed to use to actually prove (potentially!) infinitely many new results. This paper is accompanied by a Maple package, AutoSquared, and numerous sample input and output files, that readers can use as templates for generating their own, thereby proving many new ‘theorems’ about congruence properties of many famous (and, of course, obscure) combinatorial sequences.     

Model-theoretic complexity of automatic structures

We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor–Bendixson ranks (of trees). We prove the following results: (1) The ordinal height of any automatic well-founded partial order is bounded by ω^ω. (2) The ordinal heights of automatic well-founded relations are unbounded below , the first non-computable ordinal. (3) For any computable ordinal α, there is an automatic structure of Scott rank at least α. Moreover, there are automatic structures of Scott rank . (4) For any computable ordinal α, there is an automatic successor tree of Cantor–Bendixson rank α.     

Ideal polytopes and face structures of some combinatorial optimization problems

Given a finite setX and a family of feasible subsetsF ofX, the 0–1 polytope P (F is defined as the convex hull of all the characteristic vectors of members ofF We show that under a certain assumption a special type of face ofP(F) is equivalent to the ideal polytope of some pseudo-ordered set. Examples of families satisfying the assumption are those related to the maximum stable set problem, set packing and set partitioning problems, and vertex coloring problem. Using this fact, we propose a new heuristic for such problems and give results of our preliminary computational experiments for the maximum stable set problem.Supported by a JSPS Fellowship for Young Scientists.Supported by Grant-in-Aids for Co-operative Research (06740147) of the Ministry of Education, Science and Culture.     

Spectra of degrees of some structures

We argue for the existence of structures with the spectrum {x : x ≰ a} of degrees, where a is an arbitrary low degree. Also it is stated that there exist structures with the spectrum of degrees, {x : x ≰ a} ⋃ {x : x ≰ b}, for any low degrees a and b. Supported by RFBR grant No. 05-01-00605. __________ Translated from Algebra i Logika, Vol. 46, No. 6, pp. 729–744, November–December, 2007.     

On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups,and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre.We describe an algorithm that,given an arbitrary finite presentation of an automatic group Γ,will construct explicit finite models for the skeleta of K(Γ,1) and hence compute the integral homology and cohomology of Γ.     

On enumeration of polynomial equivalence classes

The isomorphism of polynomials(IP),one of the hard problems in multivariate public key cryptography induces an equivalence relation on a set of systems of polynomials.Then the enumeration problem of IP consists of counting the numbers of different classes and counting the cardinality of each class that is highly related to the scale of key space for a multivariate public key cryptosystem.In this paper we show the enumeration of the equivalence classes containing ∑n-1 i=0 aiX2qi when char(Fq) = 2,which implies that these polynomials are all weak IP instances.Moreover,we study the cardinality of an equivalence class containing the binomial aX 2q i + bX 2qj(i=j) over Fqn without the restriction that char(Fq) = 2,which gives us a deeper understanding of finite geometry as a tool to investigate the enumeration problem of IP.     

Complexity of some parametric integer and network programming problems

Two examples of parametric cost programming problems—one in network programming and one in NP-hard 0-1 programming—are given; in each case, the number of breakpoints in the optimal cost curve is exponential in the square root of the number of variables in the problem. This research is partially supported by the Air Force Office of Scientic Research. Air Force Number AFOSR-78-3646     

Obstructions to the equivalence of Poisson structures near a symplectic leaf of semisimple and compact type

We describe cohomological obstructions to the equivalence of Poisson structures around a symplectic leaf of semisimple and compact type. The result is based on Conn’s linearization theorem and the theory of Poisson coupling.     

Complexity of the min-max and min-max regret assignment problems

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment problem is strongly NP-hard.     

Complexity results in graph reconstruction

We investigate the relative complexity of the graph isomorphism problem (GI) and problems related to the reconstruction of a graph from its vertex-deleted or edge-deleted subgraphs (in particular, deck checking (DC) and legitimate deck (LD) problems). We show that these problems are closely related for all amounts c?1 of deletion:

(1)

, , , and .

(2)

For all k?2, and .

(3)

For all k?2, .

(4)

.

(5)

For all k?2, .

For many of these results, even the c=1 case was not previously known.Similar to the definition of reconstruction numbers vrn_∃(G) [F. Harary, M. Plantholt, The graph reconstruction number, J. Graph Theory 9 (1985) 451-454] and ern_∃(G) (see [J. Lauri, R. Scapellato Topics in Graph Automorphism and Reconstruction, London Mathematical Society, Cambridge University Press, Cambridge, 2003, p. 120]), we introduce two new graph parameters, vrn_∀(G) and ern_∀(G), and give an example of a family {G_n}_n?4 of graphs on n vertices for which vrn_∃(G_n)<vrn_∀(G_n). For every k?2 and n?1, we show that there exists a collection of k graphs on (2^k-1+1)n+k vertices with 2ⁿ 1-vertex-preimages, i.e., one has families of graph collections whose number of 1-vertex-preimages is huge relative to the size of the graphs involved.     

Uniqueness and counterexamples in some inverse source problems

Uniqueness of a solution is investigated for some inverse source problems arising in linear parabolic equations. We prove new uniqueness results formulated in Theorems 3.1 and 3.2. We also show optimality of the conditions under which uniqueness holds by explicitly constructing counterexamples, that is by constructing more than one solution in the case when the conditions for uniqueness are violated.     

Asymptotic enumeration of some RNA secondary structures

In this paper, we derive recursions of some RNA secondary structures with certain properties under two new representations. Furthermore, by making use of methods of asymptotic analysis and generating functions we present asymptotic enumeration of these RNA secondary structures.     

Three solutions for some Dirichlet and Neumann nonlocal problems

This article is concerned with a class of nonlocal Dirichlet and Neumann boundary-value problems depending on two real parameters. Our approach relies on variational methods: we establish the existence of three weak solutions via a recent abstract multiplicity result by Ricceri about nonlocal problems.     

The point spectra of some LQR problems

We present a sufficient and in some cases necessary condition for determining the spectra of a wide class of LQR problems in an abstract Hilbert space.     

Performance analysis of linear and nonlinear techniques for automatic scaling of discretized control problems

This paper introduces three (one linear and two nonlinear) automatic scaling techniques for NLPs with states and constraints spread over several orders of magnitude, without requiring complex off-the-shelf external tools. All of these methods have been compared to standard techniques and applied to three problems using SNOPT and IPOPT. The results confirm that the proposed techniques significantly improve the NLP conditioning, yielding more reliable and in some cases, faster NLP solutions.     

V-cycle convergence of some multigrid methods for ill-posed problems

For ill-posed linear operator equations we consider some V-cycle multigrid approaches, that, in the framework of Bramble, Pasciak, Wang, and Xu (1991), we prove to yield level independent contraction factor estimates. Consequently, we can incorporate these multigrid operators in a full multigrid method, that, together with a discrepancy principle, is shown to act as an iterative regularization method for the underlying infinite-dimensional ill-posed problem. Numerical experiments illustrate the theoretical results.