Related papers: Wildness for tensors
Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…
The category $\bcalNT$ was defined in \cite{Lobos2}, it is a category whose objects are commutative nil graded algebras over a field, defined by presentation encoded by triangular matrices. A natural problem related to this category is to…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
The problem of linearization for third order evolution equations is considered. Criteria for testing equations for linearity are presented. A class of linearizable equations depending on arbitrary functions is obtained by requiring presence…
Regression is one of the most fundamental statistical inference problems. A broad definition of regression problems is as estimation of the distribution of an outcome using a family of probability models indexed by covariates. Despite the…
In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the…
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…
Characterizing accurately chaotic behaviors is not a trivial problem and must allow to determine the properties that two given chaotic invariant sets share or not. The underlying problem is the classification of chaotic regimes, and their…
The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…
The parameterized complexity of a problem is considered "settled" once it has been shown to lie in FPT or to be complete for a class in the W-hierarchy or a similar parameterized hierarchy. Several natural parameterized problems have,…
Artificial Intelligence (AI) has long pursued models, theories, and techniques to imbue machines with human-like general intelligence. Yet even the currently predominant data-driven approaches in AI seem to be lacking humans' unique ability…
Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…
In statistics and machine learning, the traditional meaning of the terms `outlier' and `anomaly' is a case in the dataset that behaves differently from the bulk of the data. This raises suspicion that it may belong to a different…
A conjectural generalization of the McKay correspondence in terms of stringy invariants to arbitrary characteristic, including the wild case, was recently formulated by the author in the case where the given finite group linearly acts on an…
Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable. One strategy for dealing…
Let k be a field, let A a finite-dimensional hereditary k-algebra. We consider the category of all finite-dimensional A-modules. We are going to characterize the representation type of A (tame or wild) in terms of the possible subcategories…
The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree…
The gauge theory approach to the geometric Langlands program is extended to the case of wild ramification. The new ingredients that are required, relative to the tamely ramified case, are differential operators with irregular singularities,…