English
Related papers

Related papers: New parameters of subsets in polynomial schemes

200 papers

We develop a formal framework for the behavioral comparison of linear systems across different time domains. We accomplish this by introducing the notion of system interpolation, which determines whether the input-state trajectories of a…

Optimization and Control · Mathematics 2026-02-26 Armin Pirastehzad , Bart Besselink

We classify the Q-polynomial association schemes with $m_{1} = 4$ which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation $R_1$ if the scheme graph…

Combinatorics · Mathematics 2020-09-28 Da Zhao

Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have…

Information Theory · Computer Science 2025-11-10 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro , Paolo Santonastaso

Two confluent rewriting systems in noncommutatives polynomials are constructed using the equations allowing the identification of the local coordinates (of second kind) of the graphs of the $\zeta$ polymorphism as being (shuffle or…

Combinatorics · Mathematics 2026-03-05 Vincel Hoang Ngoc Minh

The interval numbers is the set of compact intervals of $\mathbb{R}$ with addition and multiplication operation, which are very useful for solving calculations where there are intervals of error or uncertainty, however, it lacks an…

General Mathematics · Mathematics 2020-03-30 Giovanny A. Fuentes Salvo

Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing…

Machine Learning · Statistics 2019-11-11 Hiroshi Kera , Yoshihiko Hasegawa

Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve IPs where the constraint matrix has bounded subdeterminants…

Data Structures and Algorithms · Computer Science 2025-03-19 Stefan Kober

The article describes prime intervals into the prime factorization of the middle binomial coefficient. Prime factors and prime powers are distributed in layers. Each layer consists of non-repeated prime numbers which are chosen (not…

Combinatorics · Mathematics 2020-03-04 Gennady Eremin

Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses…

Combinatorics · Mathematics 2025-09-24 Bryan Curtis , Mary Flagg , Leslie Hogben

This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…

Commutative Algebra · Mathematics 2016-07-15 Jie Wang

An interval graph is proper iff it has a representation in which no interval contains another. Fred Roberts characterized the proper interval graphs as those containing no induced star $K_{1,3}$. Proskurowski and Telle have studied…

Combinatorics · Mathematics 2011-10-03 Jeffrey Beyerl , Robert E. Jamison

We show that the Newton polytope of a polynomial has a strong impact on the distribution of its mass and zeros. The basic theme is that Newton polytopes determine allowed and forbidden regions for these distributions. We equip the space of…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…

Number Theory · Mathematics 2023-02-14 Jakub Byszewski , Jakub Konieczny

In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…

Complex Variables · Mathematics 2018-06-08 David G. L. Wang , Jerry J. R. Zhang

It is well known that quantum, randomized and deterministic (sequential) query complexities are polynomially related for total boolean functions. We find that significantly larger separations between the parallel generalizations of these…

Quantum Physics · Physics 2025-03-13 Joseph Carolan , Amin Shiraz Gilani , Mahathi Vempati

A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…

Combinatorics · Mathematics 2012-07-26 Nour-Eddine Fahssi

Several aspects of the internal structure of pseudoscalar mesons, accessible through generalized parton distributions in their zero-skewness limit, are examined. These include electromagnetic and gravitational form factors related to charge…

High Energy Physics - Phenomenology · Physics 2024-12-10 K. Raya , A. Bashir , J. Rodríguez-Quintero

Let $D$ be a non-empty effective divisor on $\mathbb{P}^1$. We show that when ordered by height, any set of $(D,S)$-integral points on $\mathbb{P}^1$ of bounded degree has relative density zero. We then apply this to arithmetic dynamics:…

Number Theory · Mathematics 2016-07-29 Joseph Gunther , Wade Hindes

Using non-archimedean q-integrals on Zp defined in [15, 16], we define a new Changhee q-Euler polynomials and numbers which are different from those of Kim [7] and Carlitz [2]. We define generating functions of multiple q-Euler numbers and…

Number Theory · Mathematics 2007-05-23 Taekyun Kim , SAeog-Hoon Rim

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

Optimization and Control · Mathematics 2009-02-14 Yoshiyuki Sekiguchi , Tomoyuki Takenawa , Hayato Waki