scholarly journals On Partitions and Arf Semigroups

2019 ◽  
Vol 17 (1) ◽  
pp. 343-355
Author(s):  
Nesrin Tutaş
Keyword(s):  
Positive Integer ◽  
Young Diagram ◽  
Combinatorial Properties ◽  
Arf Semigroups

Abstract In this study we examine some combinatorial properties of the Arf semigroup. In previous work, the author and Karakaş, Gümüşbaş defined an Arf partition of a positive integer n. Here, we continue this work and give new results on Arf partitions. In particular, we analyze the relation among an Arf partition, its Young dual diagram, and the corresponding rational Young diagram. Additionally, this study contains some results that present the relations between partitions and Arf semigroup polynomials.

scholarly journals A decomposition of Arf semigroups

Filomat ◽  
2020 ◽  
Vol 34 (2) ◽  
pp. 491-498
Author(s):  
Nihal Gümüşbaş ◽  
Nesrin Tutaş
Keyword(s):  
Positive Integer ◽  
Combinatorial Properties ◽  
Arf Semigroups

The aim of this work is to exhibit a kind of primitive semigroup decomposition of Arf semigroups using combinatorial properties of partitions of a positive integer n.

scholarly journals Powers of the Vandermonde determinant, Schur functions, and the dimension game

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Cristina Ballantine
Keyword(s):  
Young Diagram ◽  
Schur Functions ◽  
Symmetric Polynomial ◽  
Nous Allons ◽  
Vandermonde Determinant ◽  
Schur Function ◽  
Combinatorial Properties ◽  
International Audience

International audience Since every even power of the Vandermonde determinant is a symmetric polynomial, we want to understand its decomposition in terms of the basis of Schur functions. We investigate several combinatorial properties of the coefficients in the decomposition. In particular, I will give a recursive approach for computing the coefficient of the Schur function $s_μ$ in the decomposition of an even power of the Vandermonde determinant in $n+1$ variables in terms of the coefficient of the Schur function $s_λ$ in the decomposition of the same even power of the Vandermonde determinant in $n$ variables if the Young diagram of $μ$ is obtained from the Young diagram of $λ$ by adding a tetris type shape to the top or to the left. Comme toute puissance paire du déterminant de Vandermonde est un polynôme symétrique, nous voulons comprendre sa décomposition dans la base des fonctions de Schur. Nous allons étudier plusieurs propriétés combinatoires des coefficients de la décomposition. En particulier, nous allons donner une approche récursive pour le calcul du coefficient de la fonction de Schur $s_μ$ dans la décomposition d'une puissance paire du déterminant de Vandermonde en $n+1$ variables, en fonction du coefficient de la fonction de Schur $s_λ$ dans la décomposition de la même puissance paire du déterminant de Vandermonde en $n$ variables, lorsque le diagramme de Young de $μ$ est obtenu à partir du diagramme de Young de $λ$ par l'addition d'une forme de type tetris vers le haut ou vers la gauche.

The Order of Monochromatic Subgraphs with a Given Minimum Degree

10.37236/1725 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Yair Caro ◽  
Raphael Yuster
Keyword(s):  
Positive Integer ◽  
Minimum Degree

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order at least $t$. Let $f_G(d)=0$ in case there is a $2$-coloring of the edges of $G$ with no such monochromatic subgraph. Let $f(n,k,d)$ denote the minimum of $f_G(d)$ where $G$ ranges over all graphs with $n$ vertices and minimum degree at least $k$. In this paper we establish $f(n,k,d)$ whenever $k$ or $n-k$ are fixed, and $n$ is sufficiently large. We also consider the case where more than two colors are allowed.

Extensions of Rings Having McCoy Condition

2009 ◽  
Vol 52 (2) ◽  
pp. 267-272 ◽  
Author(s):  
Muhammet Tamer Koşan
Keyword(s):  
Positive Integer ◽  
Associative Ring ◽  
Nonzero Element ◽  
Ring Extensions

AbstractLet R be an associative ring with unity. Then R is said to be a right McCoy ring when the equation f (x)g(x) = 0 (over R[x]), where 0 ≠ f (x), g(x) ∈ R[x], implies that there exists a nonzero element c ∈ R such that f (x)c = 0. In this paper, we characterize some basic ring extensions of right McCoy rings and we prove that if R is a right McCoy ring, then R[x]/(xn) is a right McCoy ring for any positive integer n ≥ 2.

scholarly journals Further steps on the reconstruction of convex polyominoes from orthogonal projections

2021 ◽  
Author(s):  
Paolo Dulio ◽  
Andrea Frosini ◽  
Simone Rinaldi ◽  
Lama Tarsissi ◽  
Laurent Vuillon
Keyword(s):  
Discrete Geometry ◽  
Convex Subset ◽  
Convex Sets ◽  
A Priori ◽  
Orthogonal Projections ◽  
Reconstruction Process ◽  
Combinatorial Properties ◽  
The Family ◽  
Discrete Counterpart ◽  
Interior Part

AbstractA remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.

scholarly journals Cwebs beyond three loops in multiparton amplitudes

2021 ◽  
Vol 2021 (3) ◽  
Author(s):  
Neelima Agarwal ◽  
Lorenzo Magnea ◽  
Sourav Pal ◽  
Anurag Tripathi
Keyword(s):  
Gauge Theories ◽  
Anomalous Dimension ◽  
Wilson Line ◽  
Building Blocks ◽  
Feynman Diagrams ◽  
Loop Order ◽  
Abelian Gauge ◽  
Sum Rule ◽  
Combinatorial Properties ◽  
Low Dimensional

Abstract Correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of collections of Feynman diagrams called webs. In [1] we introduced the concept of Cweb, or correlator web, which is a set of skeleton diagrams built with connected gluon correlators, and we computed the mixing matrices for all Cwebs connecting four or five Wilson lines at four loops. Here we complete the evaluation of four-loop mixing matrices, presenting the results for all Cwebs connecting two and three Wilson lines. We observe that the conjuctured column sum rule is obeyed by all the mixing matrices that appear at four-loops. We also show how low-dimensional mixing matrices can be uniquely determined from their known combinatorial properties, and provide some all-order results for selected classes of mixing matrices. Our results complete the required colour building blocks for the calculation of the soft anomalous dimension matrix at four-loop order.

EVALUATION OF CONVOLUTION SUMS AND FOR k = a · b = 21, 33, AND 35

2021 ◽  
pp. 1-20
Author(s):  
K. PUSHPA ◽  
K. R. VASUKI
Keyword(s):  
Positive Integer ◽  
Quadratic Form ◽  
Eisenstein Series ◽  
Modular Forms ◽  
Divisor Function ◽  
Convolution Sums

Abstract The article focuses on the evaluation of convolution sums $${W_k}(n): = \mathop \sum \nolimits_{_{m < {n \over k}}} \sigma (m)\sigma (n - km)$$ involving the sum of divisor function $$\sigma (n)$$ for k =21, 33, and 35. In this article, our aim is to obtain certain Eisenstein series of level 21 and use them to evaluate the convolution sums for level 21. We also make use of the existing Eisenstein series identities for level 33 and 35 in evaluating the convolution sums for level 33 and 35. Most of the convolution sums were evaluated using the theory of modular forms, whereas we have devised a technique which is free from the theory of modular forms. As an application, we determine a formula for the number of representations of a positive integer n by the octonary quadratic form $$(x_1^2 + {x_1}{x_2} + ax_2^2 + x_3^2 + {x_3}{x_4} + ax_4^2) + b(x_5^2 + {x_5}{x_6} + ax_6^2 + x_7^2 + {x_7}{x_8} + ax_8^2)$$ , for (a, b)=(1, 7), (1, 11), (2, 3), and (2, 5).

scholarly journals On the Ternary Exponential Diophantine Equation Equating a Perfect Power and Sum of Products of Consecutive Integers

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Upper Bound ◽  
Exponential Diophantine Equation ◽  
Research Article ◽  
All Solutions ◽  
Sum Of Products ◽  
Consecutive Integers ◽  
Sums Of Products ◽  
Positive Integers

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

scholarly journals Repdigits as products of consecutive Padovan or Perrin numbers

2021 ◽  
Author(s):  
Salah Eddine Rihane ◽  
Alain Togbé
Keyword(s):  
Positive Integer ◽  
Decimal Expansion

AbstractA repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number of the form $$a(10^m-1)/9$$ a ( 10 m - 1 ) / 9 , for some $$m\ge 1$$ m ≥ 1 and $$1 \le a \le 9$$ 1 ≤ a ≤ 9 . Let $$\left( P_n\right) _{n\ge 0}$$ P n n ≥ 0 and $$\left( E_n\right) _{n\ge 0}$$ E n n ≥ 0 be the sequence of Padovan and Perrin numbers, respectively. This paper deals with repdigits that can be written as the products of consecutive Padovan or/and Perrin numbers.

Sign in / Sign up

Export Citation Format

Share Document