Related papers: Patterns on the numerical duplication by their adm…

Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…

We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Combining additive models and neural networks allows to broaden the scope of statistical regression and extend deep learning-based approaches by interpretable structured additive predictors at the same time. Existing attempts uniting the…

Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…

Let N be a positive integer and let f be a newform of weight 2 on \Gamma_0(N). In earlier joint work with K. Ribet and W. Stein, we introduced the notions of the modular number and the congruence number of the quotient abelian variety A_f…

In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We focus on the notion of regular fraction and we introduce methods to check whether a given symmetric orthogonal array can…

Idempotents dominate the structure theory of rings. The Peirce decomposition induced by an idempotent provides a natural environment for defining and classifying new types of rings. This point of view offers a way to unify and to expand the…

We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.

The role of integrable systems in string theory is discussed. We remind old examples of the correspondence between stringy partition functions or effective actions and integrable equations, based on effective application of the matrix model…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

We study amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and apply it to algebras associated with finitely generated groups. We show that a group G is amenable if and only if its group…

Invertibility is important in ring theory because it enables division and facilitates solving equations. Moreover, (nonassociative) rings can be endowed with an extra ''structure'' such as order and topology allowing more richness in the…

We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…

We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…

We give a simplified proof of Tits' classification of semisimple algebraic groups that remains valid over semilocal rings. In particular, we provide explicit necessary and sufficient conditions that anisotropic groups of a given type appear…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

We study the assessment of semiparametric and other highly-parametrised models from the perspective of foundational principles of parametric statistical inference. In doing so, we highlight the possibility of avoiding the usual…