Hardness of Detecting Abelian and Additive Square Factors in Strings

We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string. In particular, we conclude conditional optimality of the state-of-the-art algorithms for finding such factors. Overall, we show 3SUM-hardness of (a) detecting an Abelian square factor of an odd half-length, (b) computing centers of all Abelian square factors, (c) detecting an additive square factor in a length-$n$ string of integers of magnitude $n^{\mathcal{O}(1)}$, and (d) a problem of computing a double 3-term arithmetic progression (i.e., finding indices $i \ne j$ such that $(x_i+x_j)/2=x_{(i+j)/2}$) in a sequence of integers $x_1,\dots,x_n$ of magnitude $n^{\mathcal{O}(1)}$. Problem (d) is essentially a convolution version of the AVERAGE problem that was proposed in a manuscript of Erickson. We obtain a conditional lower bound for it with the aid of techniques recently developed by Dudek et al. [STOC 2020]. Problem (d) immediately reduces to problem (c) and is a step in reductions to problems (a) and (b). In conditional lower bounds for problems (a) and (b) we apply an encoding of Amir et al. [ICALP 2014] and extend it using several string gadgets that include arbitrarily long Abelian-square-free strings. Our reductions also imply conditional lower bounds for detecting Abelian squares in strings over a constant-sized alphabet. We also show a subquadratic upper bound in this case, applying a result of Chan and Lewenstein [STOC 2015].Comment: Accepted to ESA 202

28th Annual Symposium on Combinatorial Pattern Matching : CPM 2017, July 4-6, 2017, Warsaw, Poland

Peer reviewe

Mathematical linguistics

but in fact this is still an early draft, version 0.56, August 1 2001. Please d

Mathematical methods of signal processing

The aim of this project is to present in a systematic way the more relevant mathematical methods of signal processing, and to explore how they are applied to speech and image precessing. After explaining the more common parts of a standard course in signal processing, we put special emphasis in two new tools that have played a significant role in signal processing in the past few years: pattern theory and wavelet theory. Finally, we use all these techniques to implement an algorithm that detects the wallpaper group of a plane mosaic taking an image of it as input and an algorithm that returns the phoneme sequence of a speech signal. The material in this memory can be grouped in two parts. The first part, consisting of the first six chapters, deals with the theoretical foundation of signal processing. It also includes materials related to plane symmetry groups. The second part, consisting of the last two chapters, is focussed on the applications

Hadron models and related New Energy issues

The present book covers a wide-range of issues from alternative hadron models to their likely implications in New Energy research, including alternative interpretation of lowenergy reaction (coldfusion) phenomena. The authors explored some new approaches to describe novel phenomena in particle physics. M Pitkanen introduces his nuclear string hypothesis derived from his Topological Geometrodynamics theory, while E. Goldfain discusses a number of nonlinear dynamics methods, including bifurcation, pattern formation (complex GinzburgLandau equation) to describe elementary particle masses. Fu Yuhua discusses a plausible method for prediction of phenomena related to New Energy development. F. Smarandache discusses his unmatter hypothesis, and A. Yefremov et al. discuss Yang-Mills field from Quaternion Space Geometry. Diego Rapoport discusses theoretical link between Torsion fields and Hadronic Mechanic. A.H. Phillips discusses semiconductor nanodevices, while V. and A. Boju discuss Digital Discrete and Combinatorial methods and their likely implications in New Energy research. Pavel Pintr et al. describe planetary orbit distance from modified Schrödinger equation, and M. Pereira discusses his new Hypergeometrical description of Standard Model of elementary particles. The present volume will be suitable for researchers interested in New Energy issues, in particular their link with alternative hadron models and interpretation

LIPIcs, Volume 274, ESA 2023, Complete Volume

LIPIcs, Volume 274, ESA 2023, Complete Volum

Proceedings of the Workshop on Change of Representation and Problem Reformulation

The proceedings of the third Workshop on Change of representation and Problem Reformulation is presented. In contrast to the first two workshops, this workshop was focused on analytic or knowledge-based approaches, as opposed to statistical or empirical approaches called 'constructive induction'. The organizing committee believes that there is a potential for combining analytic and inductive approaches at a future date. However, it became apparent at the previous two workshops that the communities pursuing these different approaches are currently interested in largely non-overlapping issues. The constructive induction community has been holding its own workshops, principally in conjunction with the machine learning conference. While this workshop is more focused on analytic approaches, the organizing committee has made an effort to include more application domains. We have greatly expanded from the origins in the machine learning community. Participants in this workshop come from the full spectrum of AI application domains including planning, qualitative physics, software engineering, knowledge representation, and machine learning