English
Related papers

Related papers: Free resolutions of function classes via order com…

200 papers

The goal of the paper is to relate complexity measures associated with the evaluation of Boolean functions (certificate complexity, decision tree complexity) and learning dimensions used to characterize exact learning (teaching dimension,…

Machine Learning · Computer Science 2012-05-22 Sergiu Goschin

This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…

Computational Complexity · Computer Science 2016-11-22 Sergey Volkov

The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Karsten Schölzel

In recent years it has been noted that a number of combinatorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular…

Combinatorics · Mathematics 2018-10-01 Stuart Margolis , Franco Saliola , Benjamin Steinberg

Given a partially ordered set $P$ there exists the most general Boolean algebra $F(P)$ which contains $P$ as a generating set, called the {\it free Boolean algebra} over $P$. We study free Boolean algebras over posets of the form $P=P_0\cup…

General Topology · Mathematics 2012-10-23 Robert Bonnet , Latifa Faouzi , Wiesław Kubiś

Multisets are sets that allow repetition of elements. As such, multisets pave the way to a number of interesting possibilities of theoretical and applied nature. In the present work, after revising the main aspects of traditional sets, we…

General Mathematics · Mathematics 2021-10-27 Luciano da F. Costa

A new class of rational parametrization has been developed and it was used to generate a new family of rational functions B-splines $\displaystyle{{\left({}^{\alpha}{\mathbf B}_{i}^{k} \right)}_{i=0}^{k}}$ which depends on an index $\alpha…

Computational Geometry · Computer Science 2018-05-14 Mohamed Allaoui , Aurélien Goudjo

We explore a family of monomial ideals derived as Gr\"obner degenerations of determinantal ideals. These ideals, previously examined as block diagonal matching field ideals within the realm of toric degenerations of Grassmannians, are…

Commutative Algebra · Mathematics 2024-05-07 Fatemeh Mohammadi

Let ${\mathcal C}= \bigcup_{i=1}^n C_i \subseteq \mathbb{P}^2$ be a collection of smooth rational plane curves. We prove that the addition-deletion operation used in the study of hyperplane arrangements has an extension which works for a…

Commutative Algebra · Mathematics 2012-01-31 Hal Schenck , Stefan O. Tohaneanu

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories…

Category Theory · Mathematics 2022-04-05 Michael Lieberman , Jiří Rosický , Sebastien Vasey

A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted…

Logic in Computer Science · Computer Science 2013-10-28 Zarko Mijajlovic , Aleksandar Pejovic

We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…

Artificial Intelligence · Computer Science 2018-04-11 Daniel J. Buehrer

We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…

Commutative Algebra · Mathematics 2017-06-21 Guillermo Alesandroni

Sets of orthogonal basis functions over two-dimensional circular areas--most often representing pupils in optical applications--are known in the literature for the full circle (Zernike or Jacobi polynomials) and the annulus. This work…

Optics · Physics 2017-05-08 Richard J. Mathar

A rational function is the ratio of two complex polynomials in one variable without common roots. Its degree is the maximum of the degrees of the numerator and the denominator. Rational functions belong to the same class if one turns into…

Quantum Algebra · Mathematics 2007-05-23 I. Scherbak

We consider the minimal free resolution of a generic set of n+1 forms (not necessarily of the same degree) in a polynomial ring of n variables. The Hilbert function for such an ideal is known, thanks to a result of Stanley and of Watanabe.…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Rosa Miró-Roig

There are several remarks on Hilbert series of finitely presented (f. p.) associative algebras over a field and their modules. First, given an integer $D$, the set of Hilbert series of right-sided ideals with generators and relations of…

Rings and Algebras · Mathematics 2007-05-23 Dmitri Piontkovski

In this paper, we study a class $\mathcal{C}$ of squarefree monomial ideals $I\subseteq R=\mathbb{K}[x_1,\dots,x_n]$ over a field $\mathbb{K}$, defined by the condition that $\dim R/I$ equals the maximum degree of the minimal generators of…

Commutative Algebra · Mathematics 2026-03-19 Mohammed Rafiq Namiq

In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by S. Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the…

Commutative Algebra · Mathematics 2007-05-23 Xinxian Zheng

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Symbolic Computation · Computer Science 2023-09-26 Mihai Prunescu